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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:04:01,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:04:01,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:04:01,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:04:01,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:04:01,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:04:01,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:04:01,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:04:01,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:04:01,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:04:01,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:04:01,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:04:01,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:04:01,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:04:01,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:04:01,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:04:01,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:04:01,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:04:01,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:04:01,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:04:01,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:04:01,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:04:01,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:04:01,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:04:01,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:04:01,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:04:01,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:04:01,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:04:01,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:04:01,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:04:01,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:04:01,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:04:01,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:04:01,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:04:01,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:04:01,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:04:01,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:04:01,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:04:01,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:04:01,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:04:01,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:04:01,938 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 12:04:01,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:04:01,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:04:01,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:04:01,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:04:01,980 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:04:01,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:04:01,981 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:04:01,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:04:01,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:04:01,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:04:01,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:04:01,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:04:01,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:04:01,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:04:01,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:04:01,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:04:01,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:04:01,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:04:01,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:04:01,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:04:01,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:04:01,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:04:01,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:04:01,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:04:01,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:04:01,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:04:01,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:04:01,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:04:01,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:04:02,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:04:02,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:04:02,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:04:02,061 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:04:02,061 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:04:02,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:04:02,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd9c55d9/027fccf4eca54fdeaedd083277dce999/FLAG8858da508 [2019-09-08 12:04:02,727 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:04:02,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:04:02,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd9c55d9/027fccf4eca54fdeaedd083277dce999/FLAG8858da508 [2019-09-08 12:04:02,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd9c55d9/027fccf4eca54fdeaedd083277dce999 [2019-09-08 12:04:02,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:04:02,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:04:02,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:04:02,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:04:02,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:04:02,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:04:02" (1/1) ... [2019-09-08 12:04:02,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300edefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:02, skipping insertion in model container [2019-09-08 12:04:02,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:04:02" (1/1) ... [2019-09-08 12:04:02,972 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:04:03,100 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:04:04,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:04:04,050 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:04:04,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:04:04,450 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:04:04,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04 WrapperNode [2019-09-08 12:04:04,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:04:04,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:04:04,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:04:04,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:04:04,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (1/1) ... [2019-09-08 12:04:04,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (1/1) ... [2019-09-08 12:04:04,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (1/1) ... [2019-09-08 12:04:04,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (1/1) ... [2019-09-08 12:04:04,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (1/1) ... [2019-09-08 12:04:04,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (1/1) ... [2019-09-08 12:04:04,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (1/1) ... [2019-09-08 12:04:04,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:04:04,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:04:04,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:04:04,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:04:04,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (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 12:04:04,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:04:04,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:04:04,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:04:04,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:04:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:04:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:04:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:04:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:04:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:04:04,756 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:04:04,756 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:04:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:04:04,757 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:04:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:04:04,761 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:04:04,761 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:04:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:04:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:04:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:04:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:04:04,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:04:07,531 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:04:07,531 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:04:07,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:04:07 BoogieIcfgContainer [2019-09-08 12:04:07,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:04:07,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:04:07,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:04:07,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:04:07,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:04:02" (1/3) ... [2019-09-08 12:04:07,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ddb898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:04:07, skipping insertion in model container [2019-09-08 12:04:07,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:04" (2/3) ... [2019-09-08 12:04:07,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ddb898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:04:07, skipping insertion in model container [2019-09-08 12:04:07,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:04:07" (3/3) ... [2019-09-08 12:04:07,541 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:04:07,550 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:04:07,558 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 12:04:07,575 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 12:04:07,611 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:04:07,612 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:04:07,612 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:04:07,612 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:04:07,612 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:04:07,612 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:04:07,612 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:04:07,613 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:04:07,613 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:04:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states. [2019-09-08 12:04:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:04:07,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:07,662 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] [2019-09-08 12:04:07,665 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -753741321, now seen corresponding path program 1 times [2019-09-08 12:04:07,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:07,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:07,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:08,279 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 12:04:08,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:08,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:08,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:08,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:08,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:08,304 INFO L87 Difference]: Start difference. First operand 631 states. Second operand 5 states. [2019-09-08 12:04:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:09,218 INFO L93 Difference]: Finished difference Result 1192 states and 2041 transitions. [2019-09-08 12:04:09,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:09,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 12:04:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:09,250 INFO L225 Difference]: With dead ends: 1192 [2019-09-08 12:04:09,250 INFO L226 Difference]: Without dead ends: 715 [2019-09-08 12:04:09,262 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 12:04:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-09-08 12:04:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 655. [2019-09-08 12:04:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-08 12:04:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 871 transitions. [2019-09-08 12:04:09,395 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 871 transitions. Word has length 75 [2019-09-08 12:04:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:09,396 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 871 transitions. [2019-09-08 12:04:09,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 871 transitions. [2019-09-08 12:04:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:04:09,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:09,406 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 12:04:09,407 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash -4055452, now seen corresponding path program 1 times [2019-09-08 12:04:09,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:09,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:09,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:09,639 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 12:04:09,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:09,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:09,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:09,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:09,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:09,642 INFO L87 Difference]: Start difference. First operand 655 states and 871 transitions. Second operand 5 states. [2019-09-08 12:04:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:10,014 INFO L93 Difference]: Finished difference Result 1144 states and 1561 transitions. [2019-09-08 12:04:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:10,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:04:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:10,019 INFO L225 Difference]: With dead ends: 1144 [2019-09-08 12:04:10,020 INFO L226 Difference]: Without dead ends: 594 [2019-09-08 12:04:10,022 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 12:04:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-08 12:04:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-09-08 12:04:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-08 12:04:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 800 transitions. [2019-09-08 12:04:10,055 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 800 transitions. Word has length 76 [2019-09-08 12:04:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:10,056 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 800 transitions. [2019-09-08 12:04:10,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 800 transitions. [2019-09-08 12:04:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:04:10,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:10,059 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] [2019-09-08 12:04:10,059 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash 211673049, now seen corresponding path program 1 times [2019-09-08 12:04:10,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:10,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:10,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:10,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:10,287 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 12:04:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:10,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:10,290 INFO L87 Difference]: Start difference. First operand 594 states and 800 transitions. Second operand 5 states. [2019-09-08 12:04:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:10,675 INFO L93 Difference]: Finished difference Result 1083 states and 1488 transitions. [2019-09-08 12:04:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:10,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:04:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:10,680 INFO L225 Difference]: With dead ends: 1083 [2019-09-08 12:04:10,680 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 12:04:10,681 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 12:04:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 12:04:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-08 12:04:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 12:04:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 768 transitions. [2019-09-08 12:04:10,708 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 768 transitions. Word has length 77 [2019-09-08 12:04:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:10,709 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 768 transitions. [2019-09-08 12:04:10,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 768 transitions. [2019-09-08 12:04:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:04:10,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:10,712 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] [2019-09-08 12:04:10,712 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash -11531761, now seen corresponding path program 1 times [2019-09-08 12:04:10,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:10,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:10,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:10,850 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 12:04:10,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:10,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:10,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:10,853 INFO L87 Difference]: Start difference. First operand 568 states and 768 transitions. Second operand 5 states. [2019-09-08 12:04:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:11,270 INFO L93 Difference]: Finished difference Result 1057 states and 1454 transitions. [2019-09-08 12:04:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:11,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 12:04:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:11,274 INFO L225 Difference]: With dead ends: 1057 [2019-09-08 12:04:11,275 INFO L226 Difference]: Without dead ends: 558 [2019-09-08 12:04:11,276 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 12:04:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-08 12:04:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2019-09-08 12:04:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 12:04:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 754 transitions. [2019-09-08 12:04:11,303 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 754 transitions. Word has length 78 [2019-09-08 12:04:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:11,304 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 754 transitions. [2019-09-08 12:04:11,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 754 transitions. [2019-09-08 12:04:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:04:11,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:11,306 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 12:04:11,306 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:11,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1775015611, now seen corresponding path program 1 times [2019-09-08 12:04:11,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:11,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:11,451 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 12:04:11,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:11,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:11,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:11,454 INFO L87 Difference]: Start difference. First operand 558 states and 754 transitions. Second operand 5 states. [2019-09-08 12:04:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:11,769 INFO L93 Difference]: Finished difference Result 1047 states and 1438 transitions. [2019-09-08 12:04:11,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:11,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-08 12:04:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:11,773 INFO L225 Difference]: With dead ends: 1047 [2019-09-08 12:04:11,773 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 12:04:11,775 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 12:04:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 12:04:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2019-09-08 12:04:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 740 transitions. [2019-09-08 12:04:11,803 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 740 transitions. Word has length 79 [2019-09-08 12:04:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:11,804 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 740 transitions. [2019-09-08 12:04:11,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 740 transitions. [2019-09-08 12:04:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:04:11,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:11,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:11,806 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1857846520, now seen corresponding path program 1 times [2019-09-08 12:04:11,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:11,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:11,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:11,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:11,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:12,006 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 12:04:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:12,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:12,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:12,008 INFO L87 Difference]: Start difference. First operand 547 states and 740 transitions. Second operand 9 states. [2019-09-08 12:04:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:13,511 INFO L93 Difference]: Finished difference Result 1281 states and 1800 transitions. [2019-09-08 12:04:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:13,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 12:04:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:13,518 INFO L225 Difference]: With dead ends: 1281 [2019-09-08 12:04:13,518 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:13,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 739 transitions. [2019-09-08 12:04:13,556 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 739 transitions. Word has length 80 [2019-09-08 12:04:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:13,556 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 739 transitions. [2019-09-08 12:04:13,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 739 transitions. [2019-09-08 12:04:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:04:13,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:13,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:13,559 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1356435279, now seen corresponding path program 1 times [2019-09-08 12:04:13,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:13,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:13,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:13,775 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 12:04:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:13,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:13,777 INFO L87 Difference]: Start difference. First operand 547 states and 739 transitions. Second operand 9 states. [2019-09-08 12:04:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:15,313 INFO L93 Difference]: Finished difference Result 1277 states and 1781 transitions. [2019-09-08 12:04:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:04:15,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 12:04:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:15,320 INFO L225 Difference]: With dead ends: 1277 [2019-09-08 12:04:15,320 INFO L226 Difference]: Without dead ends: 1087 [2019-09-08 12:04:15,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:04:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-09-08 12:04:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 547. [2019-09-08 12:04:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 738 transitions. [2019-09-08 12:04:15,366 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 738 transitions. Word has length 80 [2019-09-08 12:04:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:15,366 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 738 transitions. [2019-09-08 12:04:15,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 738 transitions. [2019-09-08 12:04:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:04:15,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:15,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:15,369 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1849417194, now seen corresponding path program 1 times [2019-09-08 12:04:15,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:15,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:15,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:15,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:15,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:15,546 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 12:04:15,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:15,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:04:15,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:04:15,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:04:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:04:15,548 INFO L87 Difference]: Start difference. First operand 547 states and 738 transitions. Second operand 8 states. [2019-09-08 12:04:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:16,331 INFO L93 Difference]: Finished difference Result 1049 states and 1400 transitions. [2019-09-08 12:04:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:04:16,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-09-08 12:04:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:16,338 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 12:04:16,338 INFO L226 Difference]: Without dead ends: 775 [2019-09-08 12:04:16,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:04:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-08 12:04:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 547. [2019-09-08 12:04:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 737 transitions. [2019-09-08 12:04:16,397 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 737 transitions. Word has length 80 [2019-09-08 12:04:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:16,397 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 737 transitions. [2019-09-08 12:04:16,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:04:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 737 transitions. [2019-09-08 12:04:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:16,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:16,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:16,401 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1030150032, now seen corresponding path program 1 times [2019-09-08 12:04:16,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:16,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:16,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:16,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:16,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:16,790 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 12:04:16,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:16,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:16,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:16,792 INFO L87 Difference]: Start difference. First operand 547 states and 737 transitions. Second operand 9 states. [2019-09-08 12:04:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:18,257 INFO L93 Difference]: Finished difference Result 1244 states and 1738 transitions. [2019-09-08 12:04:18,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:18,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:04:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:18,264 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 12:04:18,264 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:18,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 736 transitions. [2019-09-08 12:04:18,310 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 736 transitions. Word has length 82 [2019-09-08 12:04:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:18,310 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 736 transitions. [2019-09-08 12:04:18,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 736 transitions. [2019-09-08 12:04:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:18,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:18,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:18,313 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1206210007, now seen corresponding path program 1 times [2019-09-08 12:04:18,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:18,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:18,517 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 12:04:18,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:18,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:18,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:18,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:18,519 INFO L87 Difference]: Start difference. First operand 547 states and 736 transitions. Second operand 9 states. [2019-09-08 12:04:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:19,933 INFO L93 Difference]: Finished difference Result 1290 states and 1804 transitions. [2019-09-08 12:04:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:19,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:04:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:19,944 INFO L225 Difference]: With dead ends: 1290 [2019-09-08 12:04:19,945 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:19,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 735 transitions. [2019-09-08 12:04:19,990 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 735 transitions. Word has length 82 [2019-09-08 12:04:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:19,990 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 735 transitions. [2019-09-08 12:04:19,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 735 transitions. [2019-09-08 12:04:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:19,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:19,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:19,992 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2075347116, now seen corresponding path program 1 times [2019-09-08 12:04:19,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:19,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:19,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:20,138 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 12:04:20,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:20,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:20,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:20,140 INFO L87 Difference]: Start difference. First operand 547 states and 735 transitions. Second operand 9 states. [2019-09-08 12:04:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:21,682 INFO L93 Difference]: Finished difference Result 1240 states and 1732 transitions. [2019-09-08 12:04:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:21,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:04:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:21,687 INFO L225 Difference]: With dead ends: 1240 [2019-09-08 12:04:21,688 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:21,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 734 transitions. [2019-09-08 12:04:21,734 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 734 transitions. Word has length 82 [2019-09-08 12:04:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:21,735 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 734 transitions. [2019-09-08 12:04:21,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 734 transitions. [2019-09-08 12:04:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:21,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:21,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:21,737 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -147519972, now seen corresponding path program 1 times [2019-09-08 12:04:21,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:21,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:21,888 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 12:04:21,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:21,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:21,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:21,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:21,890 INFO L87 Difference]: Start difference. First operand 547 states and 734 transitions. Second operand 9 states. [2019-09-08 12:04:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:23,458 INFO L93 Difference]: Finished difference Result 1244 states and 1734 transitions. [2019-09-08 12:04:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:23,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:04:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:23,465 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 12:04:23,466 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:23,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2019-09-08 12:04:23,561 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 82 [2019-09-08 12:04:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:23,562 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2019-09-08 12:04:23,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2019-09-08 12:04:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:23,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:23,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:23,564 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1924278388, now seen corresponding path program 1 times [2019-09-08 12:04:23,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:23,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:23,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:23,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:23,758 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 12:04:23,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:23,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:23,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:23,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:23,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:23,760 INFO L87 Difference]: Start difference. First operand 547 states and 733 transitions. Second operand 9 states. [2019-09-08 12:04:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:25,263 INFO L93 Difference]: Finished difference Result 1250 states and 1741 transitions. [2019-09-08 12:04:25,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:25,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:04:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:25,274 INFO L225 Difference]: With dead ends: 1250 [2019-09-08 12:04:25,274 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:25,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 731 transitions. [2019-09-08 12:04:25,322 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 731 transitions. Word has length 82 [2019-09-08 12:04:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:25,323 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 731 transitions. [2019-09-08 12:04:25,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 731 transitions. [2019-09-08 12:04:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:25,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:25,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:25,325 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1020669943, now seen corresponding path program 1 times [2019-09-08 12:04:25,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:25,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:25,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:25,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:25,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:25,495 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 12:04:25,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:25,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:25,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:25,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:25,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:25,499 INFO L87 Difference]: Start difference. First operand 547 states and 731 transitions. Second operand 9 states. [2019-09-08 12:04:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:26,800 INFO L93 Difference]: Finished difference Result 1300 states and 1812 transitions. [2019-09-08 12:04:26,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:26,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:04:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:26,806 INFO L225 Difference]: With dead ends: 1300 [2019-09-08 12:04:26,807 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:26,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2019-09-08 12:04:26,856 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 82 [2019-09-08 12:04:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:26,857 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2019-09-08 12:04:26,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2019-09-08 12:04:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:04:26,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:26,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:26,859 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1567452331, now seen corresponding path program 1 times [2019-09-08 12:04:26,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:26,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:26,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:27,040 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 12:04:27,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:27,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:27,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:27,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:27,042 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand 9 states. [2019-09-08 12:04:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:28,279 INFO L93 Difference]: Finished difference Result 1130 states and 1577 transitions. [2019-09-08 12:04:28,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:04:28,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 12:04:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:28,285 INFO L225 Difference]: With dead ends: 1130 [2019-09-08 12:04:28,285 INFO L226 Difference]: Without dead ends: 874 [2019-09-08 12:04:28,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:04:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-08 12:04:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2019-09-08 12:04:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 727 transitions. [2019-09-08 12:04:28,340 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 727 transitions. Word has length 82 [2019-09-08 12:04:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:28,341 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 727 transitions. [2019-09-08 12:04:28,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 727 transitions. [2019-09-08 12:04:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:28,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:28,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:28,349 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1772826454, now seen corresponding path program 1 times [2019-09-08 12:04:28,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:28,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:28,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:28,507 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 12:04:28,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:28,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:28,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:28,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:28,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:28,510 INFO L87 Difference]: Start difference. First operand 547 states and 727 transitions. Second operand 9 states. [2019-09-08 12:04:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:29,936 INFO L93 Difference]: Finished difference Result 1213 states and 1676 transitions. [2019-09-08 12:04:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:29,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:29,942 INFO L225 Difference]: With dead ends: 1213 [2019-09-08 12:04:29,942 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:29,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 726 transitions. [2019-09-08 12:04:29,996 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 726 transitions. Word has length 84 [2019-09-08 12:04:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:29,996 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 726 transitions. [2019-09-08 12:04:29,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 726 transitions. [2019-09-08 12:04:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:29,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:29,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:29,999 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash 156330058, now seen corresponding path program 1 times [2019-09-08 12:04:29,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:29,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:30,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:30,153 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 12:04:30,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:30,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:30,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:30,154 INFO L87 Difference]: Start difference. First operand 547 states and 726 transitions. Second operand 9 states. [2019-09-08 12:04:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:31,679 INFO L93 Difference]: Finished difference Result 1249 states and 1729 transitions. [2019-09-08 12:04:31,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:31,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:31,686 INFO L225 Difference]: With dead ends: 1249 [2019-09-08 12:04:31,687 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:31,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 725 transitions. [2019-09-08 12:04:31,748 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 725 transitions. Word has length 84 [2019-09-08 12:04:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:31,748 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 725 transitions. [2019-09-08 12:04:31,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 725 transitions. [2019-09-08 12:04:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:31,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:31,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:31,751 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:31,751 INFO L82 PathProgramCache]: Analyzing trace with hash -808913805, now seen corresponding path program 1 times [2019-09-08 12:04:31,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:31,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:31,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:31,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:31,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:31,949 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 12:04:31,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:31,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:31,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:31,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:31,952 INFO L87 Difference]: Start difference. First operand 547 states and 725 transitions. Second operand 9 states. [2019-09-08 12:04:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:33,486 INFO L93 Difference]: Finished difference Result 1210 states and 1671 transitions. [2019-09-08 12:04:33,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:33,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:33,491 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 12:04:33,491 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:33,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 724 transitions. [2019-09-08 12:04:33,547 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 724 transitions. Word has length 84 [2019-09-08 12:04:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:33,548 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 724 transitions. [2019-09-08 12:04:33,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 724 transitions. [2019-09-08 12:04:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:33,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:33,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:33,550 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1360926238, now seen corresponding path program 1 times [2019-09-08 12:04:33,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:33,692 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 12:04:33,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:33,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:33,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:33,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:33,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:33,694 INFO L87 Difference]: Start difference. First operand 547 states and 724 transitions. Second operand 9 states. [2019-09-08 12:04:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:35,293 INFO L93 Difference]: Finished difference Result 1213 states and 1673 transitions. [2019-09-08 12:04:35,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:35,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:35,299 INFO L225 Difference]: With dead ends: 1213 [2019-09-08 12:04:35,299 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:35,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2019-09-08 12:04:35,358 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 84 [2019-09-08 12:04:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:35,358 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2019-09-08 12:04:35,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2019-09-08 12:04:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:35,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:35,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:35,360 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash -948259243, now seen corresponding path program 1 times [2019-09-08 12:04:35,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:35,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:35,505 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 12:04:35,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:35,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:35,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:35,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:35,507 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand 9 states. [2019-09-08 12:04:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:37,015 INFO L93 Difference]: Finished difference Result 1210 states and 1668 transitions. [2019-09-08 12:04:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:37,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:37,020 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 12:04:37,020 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:37,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 722 transitions. [2019-09-08 12:04:37,083 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 722 transitions. Word has length 84 [2019-09-08 12:04:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:37,083 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 722 transitions. [2019-09-08 12:04:37,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 722 transitions. [2019-09-08 12:04:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:37,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:37,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:37,086 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1254134787, now seen corresponding path program 1 times [2019-09-08 12:04:37,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:37,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:37,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:37,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:37,235 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 12:04:37,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:37,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:37,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:37,237 INFO L87 Difference]: Start difference. First operand 547 states and 722 transitions. Second operand 9 states. [2019-09-08 12:04:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:38,736 INFO L93 Difference]: Finished difference Result 1208 states and 1664 transitions. [2019-09-08 12:04:38,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:38,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:38,741 INFO L225 Difference]: With dead ends: 1208 [2019-09-08 12:04:38,741 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:38,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 721 transitions. [2019-09-08 12:04:38,783 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 721 transitions. Word has length 84 [2019-09-08 12:04:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:38,783 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 721 transitions. [2019-09-08 12:04:38,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 721 transitions. [2019-09-08 12:04:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:38,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:38,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:38,786 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1128458993, now seen corresponding path program 1 times [2019-09-08 12:04:38,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:38,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:38,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:38,924 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 12:04:38,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:38,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:38,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:38,925 INFO L87 Difference]: Start difference. First operand 547 states and 721 transitions. Second operand 9 states. [2019-09-08 12:04:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:40,368 INFO L93 Difference]: Finished difference Result 1210 states and 1665 transitions. [2019-09-08 12:04:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:40,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:40,375 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 12:04:40,375 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:40,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 720 transitions. [2019-09-08 12:04:40,427 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 720 transitions. Word has length 84 [2019-09-08 12:04:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:40,427 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 720 transitions. [2019-09-08 12:04:40,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 720 transitions. [2019-09-08 12:04:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:40,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:40,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:40,429 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:40,429 INFO L82 PathProgramCache]: Analyzing trace with hash -145040535, now seen corresponding path program 1 times [2019-09-08 12:04:40,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:40,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:40,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:40,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:40,571 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 12:04:40,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:40,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:40,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:40,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:40,572 INFO L87 Difference]: Start difference. First operand 547 states and 720 transitions. Second operand 9 states. [2019-09-08 12:04:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:42,096 INFO L93 Difference]: Finished difference Result 1087 states and 1476 transitions. [2019-09-08 12:04:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:42,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:42,100 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 12:04:42,100 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:42,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 719 transitions. [2019-09-08 12:04:42,146 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 719 transitions. Word has length 84 [2019-09-08 12:04:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:42,146 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 719 transitions. [2019-09-08 12:04:42,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 719 transitions. [2019-09-08 12:04:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:42,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:42,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:42,148 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:42,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1972694375, now seen corresponding path program 1 times [2019-09-08 12:04:42,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:42,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:42,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:42,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:42,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:42,286 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 12:04:42,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:42,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:42,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:42,290 INFO L87 Difference]: Start difference. First operand 547 states and 719 transitions. Second operand 9 states. [2019-09-08 12:04:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:43,681 INFO L93 Difference]: Finished difference Result 1087 states and 1474 transitions. [2019-09-08 12:04:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:43,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:43,686 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 12:04:43,686 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:43,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 717 transitions. [2019-09-08 12:04:43,752 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 717 transitions. Word has length 84 [2019-09-08 12:04:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:43,752 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 717 transitions. [2019-09-08 12:04:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 717 transitions. [2019-09-08 12:04:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:43,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:43,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:43,755 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1587646214, now seen corresponding path program 1 times [2019-09-08 12:04:43,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:43,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:43,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:43,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:43,883 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 12:04:43,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:43,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:43,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:43,885 INFO L87 Difference]: Start difference. First operand 547 states and 717 transitions. Second operand 9 states. [2019-09-08 12:04:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:45,367 INFO L93 Difference]: Finished difference Result 1123 states and 1524 transitions. [2019-09-08 12:04:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:45,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:45,372 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 12:04:45,372 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:45,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 715 transitions. [2019-09-08 12:04:45,416 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 715 transitions. Word has length 84 [2019-09-08 12:04:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:45,417 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 715 transitions. [2019-09-08 12:04:45,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 715 transitions. [2019-09-08 12:04:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:45,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:45,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:45,418 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1234023999, now seen corresponding path program 1 times [2019-09-08 12:04:45,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:45,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:45,551 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 12:04:45,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:45,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:45,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:45,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:45,552 INFO L87 Difference]: Start difference. First operand 547 states and 715 transitions. Second operand 9 states. [2019-09-08 12:04:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:46,944 INFO L93 Difference]: Finished difference Result 1212 states and 1660 transitions. [2019-09-08 12:04:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:46,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:46,949 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 12:04:46,949 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:46,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:46,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 713 transitions. [2019-09-08 12:04:47,000 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 713 transitions. Word has length 84 [2019-09-08 12:04:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:47,000 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 713 transitions. [2019-09-08 12:04:47,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 713 transitions. [2019-09-08 12:04:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:47,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:47,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:47,002 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1787094233, now seen corresponding path program 1 times [2019-09-08 12:04:47,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:47,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:47,139 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 12:04:47,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:47,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:47,140 INFO L87 Difference]: Start difference. First operand 547 states and 713 transitions. Second operand 9 states. [2019-09-08 12:04:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:48,565 INFO L93 Difference]: Finished difference Result 1087 states and 1468 transitions. [2019-09-08 12:04:48,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:48,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:48,570 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 12:04:48,571 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:48,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 711 transitions. [2019-09-08 12:04:48,630 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 711 transitions. Word has length 84 [2019-09-08 12:04:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:48,631 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 711 transitions. [2019-09-08 12:04:48,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 711 transitions. [2019-09-08 12:04:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:48,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:48,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:48,633 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1753371594, now seen corresponding path program 1 times [2019-09-08 12:04:48,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:48,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:48,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:48,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:48,773 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 12:04:48,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:48,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:48,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:48,774 INFO L87 Difference]: Start difference. First operand 547 states and 711 transitions. Second operand 9 states. [2019-09-08 12:04:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:50,125 INFO L93 Difference]: Finished difference Result 1256 states and 1718 transitions. [2019-09-08 12:04:50,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:50,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:50,130 INFO L225 Difference]: With dead ends: 1256 [2019-09-08 12:04:50,130 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:50,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 709 transitions. [2019-09-08 12:04:50,185 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 709 transitions. Word has length 84 [2019-09-08 12:04:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:50,185 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 709 transitions. [2019-09-08 12:04:50,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2019-09-08 12:04:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:50,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:50,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:50,187 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:50,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:50,187 INFO L82 PathProgramCache]: Analyzing trace with hash -175784918, now seen corresponding path program 1 times [2019-09-08 12:04:50,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:50,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:50,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:50,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:50,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:50,313 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 12:04:50,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:50,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:50,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:50,314 INFO L87 Difference]: Start difference. First operand 547 states and 709 transitions. Second operand 9 states. [2019-09-08 12:04:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:51,770 INFO L93 Difference]: Finished difference Result 1216 states and 1657 transitions. [2019-09-08 12:04:51,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:51,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:51,774 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 12:04:51,774 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:51,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 707 transitions. [2019-09-08 12:04:51,833 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 707 transitions. Word has length 84 [2019-09-08 12:04:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:51,834 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 707 transitions. [2019-09-08 12:04:51,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 707 transitions. [2019-09-08 12:04:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:04:51,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:51,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:51,835 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1958628796, now seen corresponding path program 1 times [2019-09-08 12:04:51,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:51,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:51,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:51,968 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 12:04:51,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:51,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:51,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:51,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:51,969 INFO L87 Difference]: Start difference. First operand 547 states and 707 transitions. Second operand 9 states. [2019-09-08 12:04:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:53,554 INFO L93 Difference]: Finished difference Result 1320 states and 1805 transitions. [2019-09-08 12:04:53,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:53,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:04:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:53,557 INFO L225 Difference]: With dead ends: 1320 [2019-09-08 12:04:53,557 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:53,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 705 transitions. [2019-09-08 12:04:53,633 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 705 transitions. Word has length 84 [2019-09-08 12:04:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:53,634 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 705 transitions. [2019-09-08 12:04:53,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 705 transitions. [2019-09-08 12:04:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:04:53,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:53,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:53,635 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1126502043, now seen corresponding path program 1 times [2019-09-08 12:04:53,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:53,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:53,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:54,379 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 12:04:55,224 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 12:04:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:55,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:04:55,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:04:55,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:04:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:04:55,226 INFO L87 Difference]: Start difference. First operand 547 states and 705 transitions. Second operand 25 states. [2019-09-08 12:04:56,236 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-08 12:04:56,531 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-09-08 12:04:56,793 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 62 [2019-09-08 12:04:57,135 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2019-09-08 12:04:57,351 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:04:57,557 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-08 12:04:57,753 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2019-09-08 12:04:57,957 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-08 12:04:58,154 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-09-08 12:04:58,413 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 12:05:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:02,348 INFO L93 Difference]: Finished difference Result 1014 states and 1358 transitions. [2019-09-08 12:05:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:05:02,348 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2019-09-08 12:05:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:02,351 INFO L225 Difference]: With dead ends: 1014 [2019-09-08 12:05:02,351 INFO L226 Difference]: Without dead ends: 859 [2019-09-08 12:05:02,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:05:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-08 12:05:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 558. [2019-09-08 12:05:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-09-08 12:05:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 717 transitions. [2019-09-08 12:05:02,419 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 717 transitions. Word has length 86 [2019-09-08 12:05:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:02,419 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 717 transitions. [2019-09-08 12:05:02,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:05:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 717 transitions. [2019-09-08 12:05:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:05:02,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:02,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:02,421 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash 863263109, now seen corresponding path program 1 times [2019-09-08 12:05:02,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:02,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:02,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:02,977 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 12:05:02,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:02,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:05:02,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:05:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:05:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:05:02,979 INFO L87 Difference]: Start difference. First operand 558 states and 717 transitions. Second operand 15 states. [2019-09-08 12:05:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:04,687 INFO L93 Difference]: Finished difference Result 957 states and 1287 transitions. [2019-09-08 12:05:04,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:05:04,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-08 12:05:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:04,689 INFO L225 Difference]: With dead ends: 957 [2019-09-08 12:05:04,689 INFO L226 Difference]: Without dead ends: 712 [2019-09-08 12:05:04,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:05:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-08 12:05:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 499. [2019-09-08 12:05:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-08 12:05:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 642 transitions. [2019-09-08 12:05:04,763 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 642 transitions. Word has length 86 [2019-09-08 12:05:04,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:04,764 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 642 transitions. [2019-09-08 12:05:04,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:05:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 642 transitions. [2019-09-08 12:05:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:05:04,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:04,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:04,765 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash 679846051, now seen corresponding path program 1 times [2019-09-08 12:05:04,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:04,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:04,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:04,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:04,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:05,463 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 12:05:05,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:05,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:05:05,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:05:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:05:05,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:05:05,465 INFO L87 Difference]: Start difference. First operand 499 states and 642 transitions. Second operand 16 states. [2019-09-08 12:05:06,043 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:05:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:07,980 INFO L93 Difference]: Finished difference Result 837 states and 1063 transitions. [2019-09-08 12:05:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:05:07,980 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:05:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:07,982 INFO L225 Difference]: With dead ends: 837 [2019-09-08 12:05:07,982 INFO L226 Difference]: Without dead ends: 833 [2019-09-08 12:05:07,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:05:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-09-08 12:05:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 505. [2019-09-08 12:05:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:05:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 650 transitions. [2019-09-08 12:05:08,039 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 650 transitions. Word has length 86 [2019-09-08 12:05:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:08,040 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 650 transitions. [2019-09-08 12:05:08,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:05:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 650 transitions. [2019-09-08 12:05:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:05:08,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:08,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:08,041 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2034960557, now seen corresponding path program 1 times [2019-09-08 12:05:08,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:08,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:08,745 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 12:05:08,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:08,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:08,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:08,747 INFO L87 Difference]: Start difference. First operand 505 states and 650 transitions. Second operand 17 states. [2019-09-08 12:05:09,273 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:05:09,425 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:05:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:10,250 INFO L93 Difference]: Finished difference Result 879 states and 1193 transitions. [2019-09-08 12:05:10,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:05:10,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-08 12:05:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:10,253 INFO L225 Difference]: With dead ends: 879 [2019-09-08 12:05:10,253 INFO L226 Difference]: Without dead ends: 659 [2019-09-08 12:05:10,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:05:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-08 12:05:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 463. [2019-09-08 12:05:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-09-08 12:05:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 593 transitions. [2019-09-08 12:05:10,347 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 593 transitions. Word has length 86 [2019-09-08 12:05:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:10,347 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 593 transitions. [2019-09-08 12:05:10,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:05:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 593 transitions. [2019-09-08 12:05:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:05:10,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:10,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:10,349 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:10,349 INFO L82 PathProgramCache]: Analyzing trace with hash 327077445, now seen corresponding path program 1 times [2019-09-08 12:05:10,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:10,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:10,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:11,154 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 12:05:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:11,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:11,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:11,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:11,156 INFO L87 Difference]: Start difference. First operand 463 states and 593 transitions. Second operand 17 states. [2019-09-08 12:05:11,688 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:05:11,831 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:05:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:13,564 INFO L93 Difference]: Finished difference Result 1146 states and 1575 transitions. [2019-09-08 12:05:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:05:13,565 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-08 12:05:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:13,567 INFO L225 Difference]: With dead ends: 1146 [2019-09-08 12:05:13,567 INFO L226 Difference]: Without dead ends: 974 [2019-09-08 12:05:13,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:05:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-08 12:05:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 443. [2019-09-08 12:05:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-08 12:05:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 564 transitions. [2019-09-08 12:05:13,708 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 564 transitions. Word has length 86 [2019-09-08 12:05:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:13,709 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 564 transitions. [2019-09-08 12:05:13,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:05:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 564 transitions. [2019-09-08 12:05:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:05:13,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:13,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:13,710 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1178808939, now seen corresponding path program 1 times [2019-09-08 12:05:13,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:13,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:13,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:13,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:13,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:15,482 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 12:05:15,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:15,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:05:15,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:05:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:05:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:05:15,484 INFO L87 Difference]: Start difference. First operand 443 states and 564 transitions. Second operand 26 states. [2019-09-08 12:05:15,628 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:05:16,589 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:05:16,823 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-08 12:05:17,102 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-08 12:05:17,469 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-09-08 12:05:17,684 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:05:17,896 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:05:18,130 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-08 12:05:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:20,837 INFO L93 Difference]: Finished difference Result 728 states and 957 transitions. [2019-09-08 12:05:20,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:05:20,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2019-09-08 12:05:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:20,839 INFO L225 Difference]: With dead ends: 728 [2019-09-08 12:05:20,839 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 12:05:20,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:05:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 12:05:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 458. [2019-09-08 12:05:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-08 12:05:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 585 transitions. [2019-09-08 12:05:20,941 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 585 transitions. Word has length 86 [2019-09-08 12:05:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:20,941 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 585 transitions. [2019-09-08 12:05:20,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:05:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 585 transitions. [2019-09-08 12:05:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:05:20,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:20,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:20,943 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1246040559, now seen corresponding path program 1 times [2019-09-08 12:05:20,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:20,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:20,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:20,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:21,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:21,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:05:21,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:05:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:05:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:05:21,459 INFO L87 Difference]: Start difference. First operand 458 states and 585 transitions. Second operand 12 states. [2019-09-08 12:05:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:22,691 INFO L93 Difference]: Finished difference Result 809 states and 1074 transitions. [2019-09-08 12:05:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:05:22,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-08 12:05:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:22,695 INFO L225 Difference]: With dead ends: 809 [2019-09-08 12:05:22,695 INFO L226 Difference]: Without dead ends: 679 [2019-09-08 12:05:22,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:05:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-09-08 12:05:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 454. [2019-09-08 12:05:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-09-08 12:05:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 580 transitions. [2019-09-08 12:05:22,766 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 580 transitions. Word has length 87 [2019-09-08 12:05:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:22,766 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 580 transitions. [2019-09-08 12:05:22,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:05:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 580 transitions. [2019-09-08 12:05:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:05:22,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:22,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:22,768 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1482173800, now seen corresponding path program 1 times [2019-09-08 12:05:22,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:22,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:22,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:22,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:23,459 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 12:05:23,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:23,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:23,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:23,461 INFO L87 Difference]: Start difference. First operand 454 states and 580 transitions. Second operand 17 states. [2019-09-08 12:05:24,053 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:05:24,197 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:05:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:26,067 INFO L93 Difference]: Finished difference Result 1100 states and 1509 transitions. [2019-09-08 12:05:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:05:26,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 12:05:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:26,069 INFO L225 Difference]: With dead ends: 1100 [2019-09-08 12:05:26,069 INFO L226 Difference]: Without dead ends: 967 [2019-09-08 12:05:26,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:05:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-08 12:05:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 453. [2019-09-08 12:05:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-09-08 12:05:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 577 transitions. [2019-09-08 12:05:26,188 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 577 transitions. Word has length 87 [2019-09-08 12:05:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:26,188 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 577 transitions. [2019-09-08 12:05:26,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:05:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 577 transitions. [2019-09-08 12:05:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:05:26,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:26,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:26,190 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1059161585, now seen corresponding path program 1 times [2019-09-08 12:05:26,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:26,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:26,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:26,509 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 12:05:26,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:26,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:05:26,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:05:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:05:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:05:26,510 INFO L87 Difference]: Start difference. First operand 453 states and 577 transitions. Second operand 11 states. [2019-09-08 12:05:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:27,471 INFO L93 Difference]: Finished difference Result 1346 states and 1883 transitions. [2019-09-08 12:05:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:05:27,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-08 12:05:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:27,474 INFO L225 Difference]: With dead ends: 1346 [2019-09-08 12:05:27,474 INFO L226 Difference]: Without dead ends: 1196 [2019-09-08 12:05:27,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:05:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-09-08 12:05:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 429. [2019-09-08 12:05:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-08 12:05:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 546 transitions. [2019-09-08 12:05:27,613 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 546 transitions. Word has length 87 [2019-09-08 12:05:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:27,614 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 546 transitions. [2019-09-08 12:05:27,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:05:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 546 transitions. [2019-09-08 12:05:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:05:27,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:27,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:27,615 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1860216222, now seen corresponding path program 1 times [2019-09-08 12:05:27,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:27,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:28,008 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 12:05:28,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:28,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:05:28,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:05:28,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:05:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:05:28,009 INFO L87 Difference]: Start difference. First operand 429 states and 546 transitions. Second operand 12 states. [2019-09-08 12:05:28,468 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:05:28,608 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:05:28,822 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 12:05:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:29,597 INFO L93 Difference]: Finished difference Result 1323 states and 1848 transitions. [2019-09-08 12:05:29,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:05:29,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-08 12:05:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:29,600 INFO L225 Difference]: With dead ends: 1323 [2019-09-08 12:05:29,600 INFO L226 Difference]: Without dead ends: 1171 [2019-09-08 12:05:29,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:05:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-08 12:05:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 392. [2019-09-08 12:05:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-08 12:05:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 495 transitions. [2019-09-08 12:05:29,718 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 495 transitions. Word has length 87 [2019-09-08 12:05:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:29,718 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 495 transitions. [2019-09-08 12:05:29,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:05:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 495 transitions. [2019-09-08 12:05:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:05:29,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:29,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:29,720 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1944199773, now seen corresponding path program 1 times [2019-09-08 12:05:29,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:29,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:29,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:30,319 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 12:05:30,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:30,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:05:30,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:05:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:05:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:05:30,320 INFO L87 Difference]: Start difference. First operand 392 states and 495 transitions. Second operand 13 states. [2019-09-08 12:05:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:31,802 INFO L93 Difference]: Finished difference Result 1086 states and 1472 transitions. [2019-09-08 12:05:31,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:31,802 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-08 12:05:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:31,803 INFO L225 Difference]: With dead ends: 1086 [2019-09-08 12:05:31,803 INFO L226 Difference]: Without dead ends: 944 [2019-09-08 12:05:31,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:05:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-08 12:05:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 376. [2019-09-08 12:05:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-08 12:05:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 474 transitions. [2019-09-08 12:05:31,879 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 474 transitions. Word has length 87 [2019-09-08 12:05:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:31,879 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 474 transitions. [2019-09-08 12:05:31,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:05:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 474 transitions. [2019-09-08 12:05:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:05:31,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:31,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:31,881 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1585662154, now seen corresponding path program 1 times [2019-09-08 12:05:31,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:31,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:31,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:31,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:31,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:32,312 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 12:05:32,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:32,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:05:32,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:05:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:05:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:05:32,313 INFO L87 Difference]: Start difference. First operand 376 states and 474 transitions. Second operand 11 states. [2019-09-08 12:05:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:33,873 INFO L93 Difference]: Finished difference Result 1558 states and 2202 transitions. [2019-09-08 12:05:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:05:33,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-08 12:05:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:33,875 INFO L225 Difference]: With dead ends: 1558 [2019-09-08 12:05:33,875 INFO L226 Difference]: Without dead ends: 1398 [2019-09-08 12:05:33,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:05:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2019-09-08 12:05:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 342. [2019-09-08 12:05:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-08 12:05:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 432 transitions. [2019-09-08 12:05:33,954 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 432 transitions. Word has length 87 [2019-09-08 12:05:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:33,954 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 432 transitions. [2019-09-08 12:05:33,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:05:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 432 transitions. [2019-09-08 12:05:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:05:33,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:33,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:33,955 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542280, now seen corresponding path program 1 times [2019-09-08 12:05:33,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:33,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:33,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:33,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:33,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:34,070 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 12:05:34,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:34,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:34,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:34,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:34,073 INFO L87 Difference]: Start difference. First operand 342 states and 432 transitions. Second operand 9 states. [2019-09-08 12:05:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:35,273 INFO L93 Difference]: Finished difference Result 958 states and 1321 transitions. [2019-09-08 12:05:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:35,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:05:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:35,275 INFO L225 Difference]: With dead ends: 958 [2019-09-08 12:05:35,276 INFO L226 Difference]: Without dead ends: 802 [2019-09-08 12:05:35,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-08 12:05:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 342. [2019-09-08 12:05:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-08 12:05:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 430 transitions. [2019-09-08 12:05:35,353 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 430 transitions. Word has length 87 [2019-09-08 12:05:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:35,354 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 430 transitions. [2019-09-08 12:05:35,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 430 transitions. [2019-09-08 12:05:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:05:35,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:35,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:35,355 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1081579309, now seen corresponding path program 1 times [2019-09-08 12:05:35,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:35,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:35,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:35,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:35,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:35,495 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 12:05:35,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:35,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:35,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:35,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:35,497 INFO L87 Difference]: Start difference. First operand 342 states and 430 transitions. Second operand 9 states. [2019-09-08 12:05:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:36,282 INFO L93 Difference]: Finished difference Result 549 states and 709 transitions. [2019-09-08 12:05:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:05:36,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:05:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:36,283 INFO L225 Difference]: With dead ends: 549 [2019-09-08 12:05:36,283 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 12:05:36,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:05:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 12:05:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 342. [2019-09-08 12:05:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-08 12:05:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 429 transitions. [2019-09-08 12:05:36,369 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 429 transitions. Word has length 88 [2019-09-08 12:05:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:36,369 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 429 transitions. [2019-09-08 12:05:36,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2019-09-08 12:05:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:05:36,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:36,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:36,370 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1026055433, now seen corresponding path program 1 times [2019-09-08 12:05:36,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:36,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:36,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:36,711 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 12:05:36,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:36,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:36,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:36,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:36,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:36,712 INFO L87 Difference]: Start difference. First operand 342 states and 429 transitions. Second operand 9 states. [2019-09-08 12:05:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:37,329 INFO L93 Difference]: Finished difference Result 890 states and 1229 transitions. [2019-09-08 12:05:37,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:05:37,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:05:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:37,331 INFO L225 Difference]: With dead ends: 890 [2019-09-08 12:05:37,331 INFO L226 Difference]: Without dead ends: 724 [2019-09-08 12:05:37,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:05:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-08 12:05:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 302. [2019-09-08 12:05:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-08 12:05:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 385 transitions. [2019-09-08 12:05:37,457 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 385 transitions. Word has length 88 [2019-09-08 12:05:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:37,457 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 385 transitions. [2019-09-08 12:05:37,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 385 transitions. [2019-09-08 12:05:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:05:37,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:37,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:37,458 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash 309584746, now seen corresponding path program 1 times [2019-09-08 12:05:37,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:37,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:37,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:38,228 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 12:05:38,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:38,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:05:38,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:05:38,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:05:38,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:05:38,229 INFO L87 Difference]: Start difference. First operand 302 states and 385 transitions. Second operand 16 states. [2019-09-08 12:05:39,218 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 12:05:40,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:40,307 INFO L93 Difference]: Finished difference Result 1030 states and 1438 transitions. [2019-09-08 12:05:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:05:40,308 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-08 12:05:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:40,309 INFO L225 Difference]: With dead ends: 1030 [2019-09-08 12:05:40,309 INFO L226 Difference]: Without dead ends: 1002 [2019-09-08 12:05:40,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:05:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-08 12:05:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 282. [2019-09-08 12:05:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 12:05:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 361 transitions. [2019-09-08 12:05:40,430 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 361 transitions. Word has length 88 [2019-09-08 12:05:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:40,430 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 361 transitions. [2019-09-08 12:05:40,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:05:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 361 transitions. [2019-09-08 12:05:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:05:40,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:40,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:40,432 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash -859860802, now seen corresponding path program 1 times [2019-09-08 12:05:40,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:40,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:40,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:40,577 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 12:05:40,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:40,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:40,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:40,578 INFO L87 Difference]: Start difference. First operand 282 states and 361 transitions. Second operand 9 states. [2019-09-08 12:05:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:41,378 INFO L93 Difference]: Finished difference Result 465 states and 613 transitions. [2019-09-08 12:05:41,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:05:41,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:05:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:41,379 INFO L225 Difference]: With dead ends: 465 [2019-09-08 12:05:41,379 INFO L226 Difference]: Without dead ends: 458 [2019-09-08 12:05:41,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:05:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-08 12:05:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 282. [2019-09-08 12:05:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 12:05:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 360 transitions. [2019-09-08 12:05:41,451 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 360 transitions. Word has length 88 [2019-09-08 12:05:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:41,451 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 360 transitions. [2019-09-08 12:05:41,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 360 transitions. [2019-09-08 12:05:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:05:41,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:41,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:41,452 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1443233902, now seen corresponding path program 1 times [2019-09-08 12:05:41,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:41,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:41,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:42,055 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 12:05:42,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:42,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:05:42,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:05:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:05:42,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:05:42,056 INFO L87 Difference]: Start difference. First operand 282 states and 360 transitions. Second operand 16 states. [2019-09-08 12:05:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:44,299 INFO L93 Difference]: Finished difference Result 989 states and 1391 transitions. [2019-09-08 12:05:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:05:44,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-08 12:05:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:44,300 INFO L225 Difference]: With dead ends: 989 [2019-09-08 12:05:44,301 INFO L226 Difference]: Without dead ends: 983 [2019-09-08 12:05:44,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:05:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-09-08 12:05:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 282. [2019-09-08 12:05:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 12:05:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 359 transitions. [2019-09-08 12:05:44,377 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 359 transitions. Word has length 89 [2019-09-08 12:05:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:44,377 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 359 transitions. [2019-09-08 12:05:44,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:05:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 359 transitions. [2019-09-08 12:05:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:05:44,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:44,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:44,378 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash -868794427, now seen corresponding path program 1 times [2019-09-08 12:05:44,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:44,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:44,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:44,722 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 12:05:44,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:44,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:05:44,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:05:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:05:44,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:05:44,724 INFO L87 Difference]: Start difference. First operand 282 states and 359 transitions. Second operand 11 states. [2019-09-08 12:05:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:46,051 INFO L93 Difference]: Finished difference Result 1000 states and 1401 transitions. [2019-09-08 12:05:46,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:05:46,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-09-08 12:05:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:46,053 INFO L225 Difference]: With dead ends: 1000 [2019-09-08 12:05:46,053 INFO L226 Difference]: Without dead ends: 994 [2019-09-08 12:05:46,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:05:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-09-08 12:05:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 276. [2019-09-08 12:05:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-08 12:05:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 353 transitions. [2019-09-08 12:05:46,168 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 353 transitions. Word has length 90 [2019-09-08 12:05:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:46,168 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 353 transitions. [2019-09-08 12:05:46,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:05:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 353 transitions. [2019-09-08 12:05:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:05:46,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:46,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:46,170 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:46,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:46,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1820672010, now seen corresponding path program 1 times [2019-09-08 12:05:46,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:46,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:46,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:46,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:46,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:48,165 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 12:05:48,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:48,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 12:05:48,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 12:05:48,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 12:05:48,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:05:48,167 INFO L87 Difference]: Start difference. First operand 276 states and 353 transitions. Second operand 28 states. [2019-09-08 12:05:48,320 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:05:49,278 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 12:05:49,661 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:05:49,968 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-08 12:05:50,344 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-08 12:05:50,792 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2019-09-08 12:05:51,019 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:05:51,240 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:05:51,440 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 12:05:51,973 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 12:05:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:53,969 INFO L93 Difference]: Finished difference Result 474 states and 622 transitions. [2019-09-08 12:05:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 12:05:53,970 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2019-09-08 12:05:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:53,970 INFO L225 Difference]: With dead ends: 474 [2019-09-08 12:05:53,970 INFO L226 Difference]: Without dead ends: 466 [2019-09-08 12:05:53,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=470, Invalid=2392, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 12:05:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-08 12:05:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 281. [2019-09-08 12:05:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-08 12:05:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 358 transitions. [2019-09-08 12:05:54,049 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 358 transitions. Word has length 90 [2019-09-08 12:05:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:54,049 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 358 transitions. [2019-09-08 12:05:54,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 12:05:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 358 transitions. [2019-09-08 12:05:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:05:54,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:54,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:54,050 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash -223927789, now seen corresponding path program 1 times [2019-09-08 12:05:54,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:54,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:54,839 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 12:05:54,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:54,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:05:54,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:05:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:05:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:05:54,840 INFO L87 Difference]: Start difference. First operand 281 states and 358 transitions. Second operand 16 states. [2019-09-08 12:05:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:56,889 INFO L93 Difference]: Finished difference Result 722 states and 1001 transitions. [2019-09-08 12:05:56,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:05:56,890 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-09-08 12:05:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:56,891 INFO L225 Difference]: With dead ends: 722 [2019-09-08 12:05:56,891 INFO L226 Difference]: Without dead ends: 693 [2019-09-08 12:05:56,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:05:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-08 12:05:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 252. [2019-09-08 12:05:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-08 12:05:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2019-09-08 12:05:56,973 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 327 transitions. Word has length 91 [2019-09-08 12:05:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:56,973 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 327 transitions. [2019-09-08 12:05:56,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:05:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 327 transitions. [2019-09-08 12:05:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:05:56,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:56,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:56,975 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:56,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:56,975 INFO L82 PathProgramCache]: Analyzing trace with hash -432709058, now seen corresponding path program 1 times [2019-09-08 12:05:56,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:56,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:56,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:56,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:56,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:57,085 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 12:05:57,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:57,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:05:57,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:05:57,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:05:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:05:57,086 INFO L87 Difference]: Start difference. First operand 252 states and 327 transitions. Second operand 3 states. [2019-09-08 12:05:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:57,258 INFO L93 Difference]: Finished difference Result 496 states and 691 transitions. [2019-09-08 12:05:57,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:05:57,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 12:05:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:57,259 INFO L225 Difference]: With dead ends: 496 [2019-09-08 12:05:57,259 INFO L226 Difference]: Without dead ends: 370 [2019-09-08 12:05:57,260 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 12:05:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-08 12:05:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2019-09-08 12:05:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-08 12:05:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 498 transitions. [2019-09-08 12:05:57,391 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 498 transitions. Word has length 116 [2019-09-08 12:05:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:57,391 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 498 transitions. [2019-09-08 12:05:57,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:05:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 498 transitions. [2019-09-08 12:05:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:05:57,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:57,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:57,392 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2103932360, now seen corresponding path program 1 times [2019-09-08 12:05:57,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:57,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:57,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:57,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:57,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:57,493 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 12:05:57,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:57,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:05:57,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:05:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:05:57,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:05:57,495 INFO L87 Difference]: Start difference. First operand 368 states and 498 transitions. Second operand 7 states. [2019-09-08 12:05:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:58,552 INFO L93 Difference]: Finished difference Result 1600 states and 2326 transitions. [2019-09-08 12:05:58,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:05:58,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:05:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:58,554 INFO L225 Difference]: With dead ends: 1600 [2019-09-08 12:05:58,554 INFO L226 Difference]: Without dead ends: 1358 [2019-09-08 12:05:58,555 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 12:05:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-09-08 12:05:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 648. [2019-09-08 12:05:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-08 12:05:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 914 transitions. [2019-09-08 12:05:58,856 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 914 transitions. Word has length 118 [2019-09-08 12:05:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:58,856 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 914 transitions. [2019-09-08 12:05:58,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:05:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 914 transitions. [2019-09-08 12:05:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:05:58,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:58,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:58,857 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash -792007490, now seen corresponding path program 1 times [2019-09-08 12:05:58,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:58,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:58,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:58,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:58,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:58,963 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 12:05:58,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:58,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:05:58,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:05:58,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:05:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:05:58,966 INFO L87 Difference]: Start difference. First operand 648 states and 914 transitions. Second operand 7 states. [2019-09-08 12:06:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:00,727 INFO L93 Difference]: Finished difference Result 3104 states and 4550 transitions. [2019-09-08 12:06:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:00,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:06:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:00,731 INFO L225 Difference]: With dead ends: 3104 [2019-09-08 12:06:00,731 INFO L226 Difference]: Without dead ends: 2582 [2019-09-08 12:06:00,732 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 12:06:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-09-08 12:06:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1248. [2019-09-08 12:06:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-09-08 12:06:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1802 transitions. [2019-09-08 12:06:01,271 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1802 transitions. Word has length 118 [2019-09-08 12:06:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:01,272 INFO L475 AbstractCegarLoop]: Abstraction has 1248 states and 1802 transitions. [2019-09-08 12:06:01,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1802 transitions. [2019-09-08 12:06:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:06:01,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:01,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:01,273 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1202645697, now seen corresponding path program 1 times [2019-09-08 12:06:01,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:01,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:01,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:01,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:01,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:01,343 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 12:06:01,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:01,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:01,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:01,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:01,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:01,344 INFO L87 Difference]: Start difference. First operand 1248 states and 1802 transitions. Second operand 3 states. [2019-09-08 12:06:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:02,203 INFO L93 Difference]: Finished difference Result 2948 states and 4328 transitions. [2019-09-08 12:06:02,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:02,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:06:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:02,206 INFO L225 Difference]: With dead ends: 2948 [2019-09-08 12:06:02,206 INFO L226 Difference]: Without dead ends: 1826 [2019-09-08 12:06:02,208 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 12:06:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2019-09-08 12:06:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2019-09-08 12:06:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-08 12:06:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2646 transitions. [2019-09-08 12:06:03,030 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2646 transitions. Word has length 118 [2019-09-08 12:06:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:03,030 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2646 transitions. [2019-09-08 12:06:03,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2646 transitions. [2019-09-08 12:06:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:06:03,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:03,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:03,033 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash 492458048, now seen corresponding path program 1 times [2019-09-08 12:06:03,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:03,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:03,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:03,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:03,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:03,101 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 12:06:03,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:03,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:03,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:03,102 INFO L87 Difference]: Start difference. First operand 1824 states and 2646 transitions. Second operand 3 states. [2019-09-08 12:06:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:04,377 INFO L93 Difference]: Finished difference Result 4380 states and 6402 transitions. [2019-09-08 12:06:04,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:04,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:06:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:04,380 INFO L225 Difference]: With dead ends: 4380 [2019-09-08 12:06:04,380 INFO L226 Difference]: Without dead ends: 2682 [2019-09-08 12:06:04,383 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 12:06:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-09-08 12:06:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2656. [2019-09-08 12:06:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-09-08 12:06:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3832 transitions. [2019-09-08 12:06:05,657 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3832 transitions. Word has length 118 [2019-09-08 12:06:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:05,658 INFO L475 AbstractCegarLoop]: Abstraction has 2656 states and 3832 transitions. [2019-09-08 12:06:05,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3832 transitions. [2019-09-08 12:06:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:06:05,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:05,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:05,659 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash -208893878, now seen corresponding path program 1 times [2019-09-08 12:06:05,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:05,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:05,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:05,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:05,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:05,758 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 12:06:05,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:05,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:05,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:05,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:05,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:05,760 INFO L87 Difference]: Start difference. First operand 2656 states and 3832 transitions. Second operand 7 states. [2019-09-08 12:06:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:11,348 INFO L93 Difference]: Finished difference Result 12992 states and 18828 transitions. [2019-09-08 12:06:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:11,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:06:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:11,359 INFO L225 Difference]: With dead ends: 12992 [2019-09-08 12:06:11,359 INFO L226 Difference]: Without dead ends: 10462 [2019-09-08 12:06:11,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2019-09-08 12:06:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 5544. [2019-09-08 12:06:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5544 states. [2019-09-08 12:06:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 8030 transitions. [2019-09-08 12:06:14,051 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 8030 transitions. Word has length 118 [2019-09-08 12:06:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:14,052 INFO L475 AbstractCegarLoop]: Abstraction has 5544 states and 8030 transitions. [2019-09-08 12:06:14,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 8030 transitions. [2019-09-08 12:06:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:06:14,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:14,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:14,054 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:14,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:14,054 INFO L82 PathProgramCache]: Analyzing trace with hash 781686468, now seen corresponding path program 1 times [2019-09-08 12:06:14,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:14,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:14,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:14,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:14,143 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 12:06:14,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:14,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:14,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:14,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:14,145 INFO L87 Difference]: Start difference. First operand 5544 states and 8030 transitions. Second operand 7 states. [2019-09-08 12:06:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:23,710 INFO L93 Difference]: Finished difference Result 23816 states and 34590 transitions. [2019-09-08 12:06:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:23,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:06:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:23,727 INFO L225 Difference]: With dead ends: 23816 [2019-09-08 12:06:23,727 INFO L226 Difference]: Without dead ends: 18398 [2019-09-08 12:06:23,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18398 states. [2019-09-08 12:06:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18398 to 11680. [2019-09-08 12:06:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11680 states. [2019-09-08 12:06:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11680 states to 11680 states and 16930 transitions. [2019-09-08 12:06:29,420 INFO L78 Accepts]: Start accepts. Automaton has 11680 states and 16930 transitions. Word has length 118 [2019-09-08 12:06:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:29,420 INFO L475 AbstractCegarLoop]: Abstraction has 11680 states and 16930 transitions. [2019-09-08 12:06:29,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 11680 states and 16930 transitions. [2019-09-08 12:06:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:06:29,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:29,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:29,423 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1587754861, now seen corresponding path program 1 times [2019-09-08 12:06:29,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:29,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:29,466 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 12:06:29,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:29,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:29,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:29,468 INFO L87 Difference]: Start difference. First operand 11680 states and 16930 transitions. Second operand 3 states. [2019-09-08 12:06:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:35,984 INFO L93 Difference]: Finished difference Result 24420 states and 35428 transitions. [2019-09-08 12:06:35,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:35,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-08 12:06:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:35,997 INFO L225 Difference]: With dead ends: 24420 [2019-09-08 12:06:35,997 INFO L226 Difference]: Without dead ends: 12866 [2019-09-08 12:06:36,010 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 12:06:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12866 states. [2019-09-08 12:06:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12866 to 12768. [2019-09-08 12:06:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12768 states. [2019-09-08 12:06:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12768 states to 12768 states and 18426 transitions. [2019-09-08 12:06:42,090 INFO L78 Accepts]: Start accepts. Automaton has 12768 states and 18426 transitions. Word has length 119 [2019-09-08 12:06:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:42,090 INFO L475 AbstractCegarLoop]: Abstraction has 12768 states and 18426 transitions. [2019-09-08 12:06:42,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12768 states and 18426 transitions. [2019-09-08 12:06:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:06:42,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:42,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:42,093 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash 546629509, now seen corresponding path program 1 times [2019-09-08 12:06:42,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:42,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:42,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:42,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:42,184 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 12:06:42,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:42,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:42,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:42,186 INFO L87 Difference]: Start difference. First operand 12768 states and 18426 transitions. Second operand 7 states. [2019-09-08 12:06:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:55,922 INFO L93 Difference]: Finished difference Result 39496 states and 56766 transitions. [2019-09-08 12:06:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:56,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-08 12:06:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:56,058 INFO L225 Difference]: With dead ends: 39496 [2019-09-08 12:06:56,058 INFO L226 Difference]: Without dead ends: 26854 [2019-09-08 12:06:56,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26854 states. [2019-09-08 12:07:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26854 to 15008. [2019-09-08 12:07:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-09-08 12:07:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 21418 transitions. [2019-09-08 12:07:04,234 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 21418 transitions. Word has length 119 [2019-09-08 12:07:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:04,234 INFO L475 AbstractCegarLoop]: Abstraction has 15008 states and 21418 transitions. [2019-09-08 12:07:04,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 21418 transitions. [2019-09-08 12:07:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:07:04,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:04,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:04,236 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1431856554, now seen corresponding path program 1 times [2019-09-08 12:07:04,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:04,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:04,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:04,345 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 12:07:04,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:04,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:07:04,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:07:04,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:07:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:07:04,346 INFO L87 Difference]: Start difference. First operand 15008 states and 21418 transitions. Second operand 6 states. [2019-09-08 12:07:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:17,024 INFO L93 Difference]: Finished difference Result 23948 states and 33622 transitions. [2019-09-08 12:07:17,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:07:17,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-08 12:07:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:17,048 INFO L225 Difference]: With dead ends: 23948 [2019-09-08 12:07:17,048 INFO L226 Difference]: Without dead ends: 23946 [2019-09-08 12:07:17,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:07:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23946 states. [2019-09-08 12:07:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23946 to 15200. [2019-09-08 12:07:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15200 states. [2019-09-08 12:07:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15200 states to 15200 states and 21546 transitions. [2019-09-08 12:07:25,045 INFO L78 Accepts]: Start accepts. Automaton has 15200 states and 21546 transitions. Word has length 119 [2019-09-08 12:07:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:25,045 INFO L475 AbstractCegarLoop]: Abstraction has 15200 states and 21546 transitions. [2019-09-08 12:07:25,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:07:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15200 states and 21546 transitions. [2019-09-08 12:07:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:07:25,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:25,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:25,048 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:25,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1588867289, now seen corresponding path program 1 times [2019-09-08 12:07:25,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:25,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:25,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:25,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:25,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:25,116 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 12:07:25,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:25,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:25,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:25,118 INFO L87 Difference]: Start difference. First operand 15200 states and 21546 transitions. Second operand 3 states. [2019-09-08 12:07:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:32,646 INFO L93 Difference]: Finished difference Result 29492 states and 41788 transitions. [2019-09-08 12:07:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:32,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:07:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:32,661 INFO L225 Difference]: With dead ends: 29492 [2019-09-08 12:07:32,661 INFO L226 Difference]: Without dead ends: 14418 [2019-09-08 12:07:32,678 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 12:07:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14418 states. [2019-09-08 12:07:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14418 to 13680. [2019-09-08 12:07:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13680 states. [2019-09-08 12:07:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13680 states to 13680 states and 19338 transitions. [2019-09-08 12:07:40,125 INFO L78 Accepts]: Start accepts. Automaton has 13680 states and 19338 transitions. Word has length 120 [2019-09-08 12:07:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:40,125 INFO L475 AbstractCegarLoop]: Abstraction has 13680 states and 19338 transitions. [2019-09-08 12:07:40,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13680 states and 19338 transitions. [2019-09-08 12:07:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:07:40,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:40,132 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:07:40,132 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 97136551, now seen corresponding path program 1 times [2019-09-08 12:07:40,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:40,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:40,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:40,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:40,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:40,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:40,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:40,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:40,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:40,213 INFO L87 Difference]: Start difference. First operand 13680 states and 19338 transitions. Second operand 3 states. [2019-09-08 12:07:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:47,168 INFO L93 Difference]: Finished difference Result 26396 states and 37260 transitions. [2019-09-08 12:07:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:47,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-08 12:07:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:47,181 INFO L225 Difference]: With dead ends: 26396 [2019-09-08 12:07:47,181 INFO L226 Difference]: Without dead ends: 12842 [2019-09-08 12:07:47,195 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 12:07:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12842 states. [2019-09-08 12:07:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12842 to 12600. [2019-09-08 12:07:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12600 states. [2019-09-08 12:07:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 17638 transitions. [2019-09-08 12:07:53,909 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 17638 transitions. Word has length 148 [2019-09-08 12:07:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:53,910 INFO L475 AbstractCegarLoop]: Abstraction has 12600 states and 17638 transitions. [2019-09-08 12:07:53,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 17638 transitions. [2019-09-08 12:07:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 12:07:53,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:53,915 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:07:53,915 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1930660436, now seen corresponding path program 1 times [2019-09-08 12:07:53,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:53,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:53,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:53,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:53,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:53,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:53,998 INFO L87 Difference]: Start difference. First operand 12600 states and 17638 transitions. Second operand 3 states. [2019-09-08 12:07:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:59,907 INFO L93 Difference]: Finished difference Result 23560 states and 32876 transitions. [2019-09-08 12:07:59,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:59,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 12:07:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:59,919 INFO L225 Difference]: With dead ends: 23560 [2019-09-08 12:07:59,919 INFO L226 Difference]: Without dead ends: 11086 [2019-09-08 12:07:59,930 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 12:07:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2019-09-08 12:08:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 10944. [2019-09-08 12:08:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10944 states. [2019-09-08 12:08:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10944 states to 10944 states and 14990 transitions. [2019-09-08 12:08:05,801 INFO L78 Accepts]: Start accepts. Automaton has 10944 states and 14990 transitions. Word has length 149 [2019-09-08 12:08:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:05,802 INFO L475 AbstractCegarLoop]: Abstraction has 10944 states and 14990 transitions. [2019-09-08 12:08:05,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:08:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 10944 states and 14990 transitions. [2019-09-08 12:08:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:08:05,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:05,806 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:05,806 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:05,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1187284375, now seen corresponding path program 1 times [2019-09-08 12:08:05,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:05,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:05,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:05,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:08:05,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:05,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:08:05,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:08:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:08:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:08:05,961 INFO L87 Difference]: Start difference. First operand 10944 states and 14990 transitions. Second operand 7 states. [2019-09-08 12:08:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:35,790 INFO L93 Difference]: Finished difference Result 64692 states and 88524 transitions. [2019-09-08 12:08:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:08:35,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-08 12:08:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:35,846 INFO L225 Difference]: With dead ends: 64692 [2019-09-08 12:08:35,847 INFO L226 Difference]: Without dead ends: 53874 [2019-09-08 12:08:35,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:08:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53874 states. [2019-09-08 12:08:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53874 to 18512. [2019-09-08 12:08:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18512 states. [2019-09-08 12:08:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18512 states to 18512 states and 25262 transitions. [2019-09-08 12:08:46,110 INFO L78 Accepts]: Start accepts. Automaton has 18512 states and 25262 transitions. Word has length 150 [2019-09-08 12:08:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:46,110 INFO L475 AbstractCegarLoop]: Abstraction has 18512 states and 25262 transitions. [2019-09-08 12:08:46,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:08:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18512 states and 25262 transitions. [2019-09-08 12:08:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:08:46,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:46,115 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:08:46,115 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1795758051, now seen corresponding path program 1 times [2019-09-08 12:08:46,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:46,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:46,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:46,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:46,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:08:46,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:46,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:08:46,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:08:46,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:08:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:08:46,218 INFO L87 Difference]: Start difference. First operand 18512 states and 25262 transitions. Second operand 5 states. [2019-09-08 12:09:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:01,193 INFO L93 Difference]: Finished difference Result 37790 states and 51653 transitions. [2019-09-08 12:09:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:01,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 12:09:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:01,220 INFO L225 Difference]: With dead ends: 37790 [2019-09-08 12:09:01,221 INFO L226 Difference]: Without dead ends: 26972 [2019-09-08 12:09:01,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:09:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26972 states. [2019-09-08 12:09:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26972 to 22344. [2019-09-08 12:09:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22344 states. [2019-09-08 12:09:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22344 states to 22344 states and 30518 transitions. [2019-09-08 12:09:14,589 INFO L78 Accepts]: Start accepts. Automaton has 22344 states and 30518 transitions. Word has length 150 [2019-09-08 12:09:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:14,590 INFO L475 AbstractCegarLoop]: Abstraction has 22344 states and 30518 transitions. [2019-09-08 12:09:14,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:09:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 22344 states and 30518 transitions. [2019-09-08 12:09:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:09:14,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:14,595 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:14,595 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 176034417, now seen corresponding path program 1 times [2019-09-08 12:09:14,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:14,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:14,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:14,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:14,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:14,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:14,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:14,653 INFO L87 Difference]: Start difference. First operand 22344 states and 30518 transitions. Second operand 3 states. [2019-09-08 12:09:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:26,674 INFO L93 Difference]: Finished difference Result 42788 states and 58244 transitions. [2019-09-08 12:09:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:26,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 12:09:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:26,695 INFO L225 Difference]: With dead ends: 42788 [2019-09-08 12:09:26,696 INFO L226 Difference]: Without dead ends: 20570 [2019-09-08 12:09:26,714 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 12:09:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2019-09-08 12:09:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 15666. [2019-09-08 12:09:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15666 states. [2019-09-08 12:09:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15666 states to 15666 states and 20998 transitions. [2019-09-08 12:09:36,209 INFO L78 Accepts]: Start accepts. Automaton has 15666 states and 20998 transitions. Word has length 151 [2019-09-08 12:09:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:36,209 INFO L475 AbstractCegarLoop]: Abstraction has 15666 states and 20998 transitions. [2019-09-08 12:09:36,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 15666 states and 20998 transitions. [2019-09-08 12:09:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:09:36,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:36,212 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:09:36,212 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:36,213 INFO L82 PathProgramCache]: Analyzing trace with hash 88060660, now seen corresponding path program 1 times [2019-09-08 12:09:36,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:36,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:36,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:36,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:36,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 12:09:36,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:36,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:09:36,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:09:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:09:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:09:36,323 INFO L87 Difference]: Start difference. First operand 15666 states and 20998 transitions. Second operand 5 states. [2019-09-08 12:09:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:48,937 INFO L93 Difference]: Finished difference Result 31354 states and 42041 transitions. [2019-09-08 12:09:48,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:09:48,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-08 12:09:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:48,960 INFO L225 Difference]: With dead ends: 31354 [2019-09-08 12:09:48,960 INFO L226 Difference]: Without dead ends: 21130 [2019-09-08 12:09:48,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:09:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21130 states. [2019-09-08 12:10:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21130 to 18360. [2019-09-08 12:10:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18360 states. [2019-09-08 12:10:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18360 states to 18360 states and 24628 transitions. [2019-09-08 12:10:00,494 INFO L78 Accepts]: Start accepts. Automaton has 18360 states and 24628 transitions. Word has length 151 [2019-09-08 12:10:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:00,494 INFO L475 AbstractCegarLoop]: Abstraction has 18360 states and 24628 transitions. [2019-09-08 12:10:00,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:10:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18360 states and 24628 transitions. [2019-09-08 12:10:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:10:00,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:00,497 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:10:00,498 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash 534792928, now seen corresponding path program 1 times [2019-09-08 12:10:00,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:00,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:00,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:10:00,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:10:00,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:10:00,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:01,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:10:01,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:10:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:10:01,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:10:01,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-09-08 12:10:01,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:10:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:10:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:10:01,297 INFO L87 Difference]: Start difference. First operand 18360 states and 24628 transitions. Second operand 17 states. [2019-09-08 12:10:02,074 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-08 12:10:03,076 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:10:05,745 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:10:07,000 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:10:08,991 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 12:10:11,567 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:10:11,698 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:10:12,294 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:10:12,422 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:10:12,872 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:10:14,886 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:10:17,218 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:10:17,427 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:10:18,174 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:10:35,114 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:10:37,365 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:10:39,099 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:13:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:46,063 INFO L93 Difference]: Finished difference Result 332950 states and 443964 transitions. [2019-09-08 12:13:46,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-08 12:13:46,063 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 152 [2019-09-08 12:13:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:46,858 INFO L225 Difference]: With dead ends: 332950 [2019-09-08 12:13:46,859 INFO L226 Difference]: Without dead ends: 314716 [2019-09-08 12:13:46,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11599 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=5208, Invalid=23184, Unknown=0, NotChecked=0, Total=28392 [2019-09-08 12:13:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314716 states. [2019-09-08 12:14:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314716 to 68714. [2019-09-08 12:14:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68714 states. [2019-09-08 12:14:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68714 states to 68714 states and 91847 transitions. [2019-09-08 12:14:37,279 INFO L78 Accepts]: Start accepts. Automaton has 68714 states and 91847 transitions. Word has length 152 [2019-09-08 12:14:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:14:37,279 INFO L475 AbstractCegarLoop]: Abstraction has 68714 states and 91847 transitions. [2019-09-08 12:14:37,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:14:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 68714 states and 91847 transitions. [2019-09-08 12:14:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:14:37,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:14:37,298 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:14:37,298 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:14:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:14:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash -32360173, now seen corresponding path program 1 times [2019-09-08 12:14:37,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:14:37,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:14:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:37,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:14:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:14:37,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:14:37,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:14:37,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:14:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:14:38,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:14:38,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:14:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:14:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:14:38,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 12:14:38,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:14:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:14:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:14:38,274 INFO L87 Difference]: Start difference. First operand 68714 states and 91847 transitions. Second operand 15 states. [2019-09-08 12:14:54,570 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29