java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:16:33,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:16:33,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:16:33,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:16:33,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:16:33,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:16:33,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:16:33,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:16:33,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:16:33,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:16:33,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:16:33,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:16:33,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:16:33,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:16:33,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:16:33,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:16:33,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:16:33,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:16:33,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:16:33,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:16:33,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:16:33,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:16:33,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:16:33,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:16:33,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:16:33,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:16:33,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:16:33,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:16:33,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:16:33,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:16:33,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:16:33,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:16:33,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:16:33,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:16:34,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:16:34,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:16:34,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:16:34,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:16:34,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:16:34,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:16:34,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:16:34,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:16:34,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:16:34,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:16:34,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:16:34,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:16:34,041 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:16:34,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:16:34,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:16:34,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:16:34,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:16:34,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:16:34,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:16:34,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:16:34,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:16:34,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:16:34,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:16:34,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:16:34,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:16:34,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:16:34,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:16:34,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:16:34,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:16:34,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:16:34,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:16:34,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:16:34,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:16:34,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:16:34,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:16:34,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:16:34,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:16:34,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:16:34,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:16:34,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:16:34,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:16:34,101 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:16:34,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:16:34,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d5cf59f/1add100625734c679267c29847144164/FLAGc951ca823 [2019-09-08 10:16:34,890 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:16:34,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:16:34,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d5cf59f/1add100625734c679267c29847144164/FLAGc951ca823 [2019-09-08 10:16:34,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d5cf59f/1add100625734c679267c29847144164 [2019-09-08 10:16:35,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:16:35,005 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:16:35,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:16:35,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:16:35,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:16:35,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:16:34" (1/1) ... [2019-09-08 10:16:35,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585b6776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:35, skipping insertion in model container [2019-09-08 10:16:35,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:16:34" (1/1) ... [2019-09-08 10:16:35,024 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:16:35,194 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:16:36,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:16:36,437 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:16:36,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:16:36,872 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:16:36,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36 WrapperNode [2019-09-08 10:16:36,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:16:36,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:16:36,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:16:36,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:16:36,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... [2019-09-08 10:16:36,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... [2019-09-08 10:16:36,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... [2019-09-08 10:16:36,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... [2019-09-08 10:16:37,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... [2019-09-08 10:16:37,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... [2019-09-08 10:16:37,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... [2019-09-08 10:16:37,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:16:37,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:16:37,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:16:37,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:16:37,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:16:37,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:16:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:16:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:16:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:16:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:16:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:16:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:16:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:16:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:16:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:16:40,695 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:16:40,696 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:16:40,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:16:40 BoogieIcfgContainer [2019-09-08 10:16:40,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:16:40,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:16:40,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:16:40,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:16:40,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:16:34" (1/3) ... [2019-09-08 10:16:40,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a072d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:16:40, skipping insertion in model container [2019-09-08 10:16:40,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:36" (2/3) ... [2019-09-08 10:16:40,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a072d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:16:40, skipping insertion in model container [2019-09-08 10:16:40,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:16:40" (3/3) ... [2019-09-08 10:16:40,707 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:16:40,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:16:40,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-08 10:16:40,763 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-08 10:16:40,808 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:16:40,809 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:16:40,809 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:16:40,809 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:16:40,809 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:16:40,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:16:40,810 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:16:40,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:16:40,810 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:16:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-09-08 10:16:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:16:40,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:40,879 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] [2019-09-08 10:16:40,882 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-09-08 10:16:40,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:40,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:41,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:41,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:16:41,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:16:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:16:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:16:41,482 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-09-08 10:16:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:43,704 INFO L93 Difference]: Finished difference Result 2530 states and 4342 transitions. [2019-09-08 10:16:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:43,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 10:16:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:43,734 INFO L225 Difference]: With dead ends: 2530 [2019-09-08 10:16:43,735 INFO L226 Difference]: Without dead ends: 1602 [2019-09-08 10:16:43,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-09-08 10:16:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1596. [2019-09-08 10:16:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-09-08 10:16:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2078 transitions. [2019-09-08 10:16:43,964 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2078 transitions. Word has length 56 [2019-09-08 10:16:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:43,965 INFO L475 AbstractCegarLoop]: Abstraction has 1596 states and 2078 transitions. [2019-09-08 10:16:43,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:16:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2078 transitions. [2019-09-08 10:16:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:16:43,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:43,976 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] [2019-09-08 10:16:43,977 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-09-08 10:16:43,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:43,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:43,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:43,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:44,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:44,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:16:44,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:16:44,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:16:44,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:16:44,236 INFO L87 Difference]: Start difference. First operand 1596 states and 2078 transitions. Second operand 6 states. [2019-09-08 10:16:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:45,738 INFO L93 Difference]: Finished difference Result 3605 states and 4747 transitions. [2019-09-08 10:16:45,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:45,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:16:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:45,758 INFO L225 Difference]: With dead ends: 3605 [2019-09-08 10:16:45,759 INFO L226 Difference]: Without dead ends: 2611 [2019-09-08 10:16:45,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:16:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2019-09-08 10:16:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2588. [2019-09-08 10:16:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-09-08 10:16:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3422 transitions. [2019-09-08 10:16:45,962 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3422 transitions. Word has length 57 [2019-09-08 10:16:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:45,963 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 3422 transitions. [2019-09-08 10:16:45,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:16:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3422 transitions. [2019-09-08 10:16:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:16:45,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:45,971 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] [2019-09-08 10:16:45,971 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-09-08 10:16:45,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:45,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:45,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:46,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:46,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:16:46,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:16:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:16:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:16:46,308 INFO L87 Difference]: Start difference. First operand 2588 states and 3422 transitions. Second operand 6 states. [2019-09-08 10:16:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:47,653 INFO L93 Difference]: Finished difference Result 6112 states and 8191 transitions. [2019-09-08 10:16:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:47,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:16:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:47,681 INFO L225 Difference]: With dead ends: 6112 [2019-09-08 10:16:47,682 INFO L226 Difference]: Without dead ends: 4460 [2019-09-08 10:16:47,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:16:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-09-08 10:16:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4444. [2019-09-08 10:16:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-08 10:16:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5927 transitions. [2019-09-08 10:16:47,950 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5927 transitions. Word has length 57 [2019-09-08 10:16:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:47,951 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5927 transitions. [2019-09-08 10:16:47,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:16:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5927 transitions. [2019-09-08 10:16:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:16:47,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:47,956 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] [2019-09-08 10:16:47,957 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-09-08 10:16:47,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:47,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:47,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:47,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:47,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:48,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:48,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:16:48,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:16:48,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:16:48,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:16:48,164 INFO L87 Difference]: Start difference. First operand 4444 states and 5927 transitions. Second operand 9 states. [2019-09-08 10:16:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:51,643 INFO L93 Difference]: Finished difference Result 8498 states and 12040 transitions. [2019-09-08 10:16:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:16:51,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:16:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:51,693 INFO L225 Difference]: With dead ends: 8498 [2019-09-08 10:16:51,694 INFO L226 Difference]: Without dead ends: 8492 [2019-09-08 10:16:51,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:16:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8492 states. [2019-09-08 10:16:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8492 to 4444. [2019-09-08 10:16:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-08 10:16:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5926 transitions. [2019-09-08 10:16:52,009 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5926 transitions. Word has length 59 [2019-09-08 10:16:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:52,010 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5926 transitions. [2019-09-08 10:16:52,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:16:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5926 transitions. [2019-09-08 10:16:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:16:52,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:52,016 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] [2019-09-08 10:16:52,017 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-09-08 10:16:52,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:52,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:52,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:52,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:52,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:16:52,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:16:52,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:16:52,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:16:52,285 INFO L87 Difference]: Start difference. First operand 4444 states and 5926 transitions. Second operand 9 states. [2019-09-08 10:16:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:56,060 INFO L93 Difference]: Finished difference Result 12604 states and 17782 transitions. [2019-09-08 10:16:56,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:16:56,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:16:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:56,115 INFO L225 Difference]: With dead ends: 12604 [2019-09-08 10:16:56,115 INFO L226 Difference]: Without dead ends: 11461 [2019-09-08 10:16:56,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:16:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-09-08 10:16:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4444. [2019-09-08 10:16:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-08 10:16:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5925 transitions. [2019-09-08 10:16:56,516 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5925 transitions. Word has length 59 [2019-09-08 10:16:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:56,517 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5925 transitions. [2019-09-08 10:16:56,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:16:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5925 transitions. [2019-09-08 10:16:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:16:56,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:56,522 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] [2019-09-08 10:16:56,522 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-09-08 10:16:56,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:56,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:56,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:56,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 10:16:56,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:56,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:16:56,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:16:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:16:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:16:56,777 INFO L87 Difference]: Start difference. First operand 4444 states and 5925 transitions. Second operand 8 states. [2019-09-08 10:16:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:59,488 INFO L93 Difference]: Finished difference Result 9652 states and 13825 transitions. [2019-09-08 10:16:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:16:59,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-08 10:16:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:59,512 INFO L225 Difference]: With dead ends: 9652 [2019-09-08 10:16:59,513 INFO L226 Difference]: Without dead ends: 8259 [2019-09-08 10:16:59,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:16:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8259 states. [2019-09-08 10:16:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8259 to 4444. [2019-09-08 10:16:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-08 10:16:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5924 transitions. [2019-09-08 10:16:59,791 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5924 transitions. Word has length 59 [2019-09-08 10:16:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:59,792 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5924 transitions. [2019-09-08 10:16:59,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:16:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5924 transitions. [2019-09-08 10:16:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:16:59,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:59,797 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] [2019-09-08 10:16:59,798 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-09-08 10:16:59,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:59,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:59,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:59,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:16:59,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:16:59,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:16:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:59,920 INFO L87 Difference]: Start difference. First operand 4444 states and 5924 transitions. Second operand 3 states. [2019-09-08 10:17:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:00,533 INFO L93 Difference]: Finished difference Result 8599 states and 11645 transitions. [2019-09-08 10:17:00,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:00,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:17:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:00,548 INFO L225 Difference]: With dead ends: 8599 [2019-09-08 10:17:00,548 INFO L226 Difference]: Without dead ends: 6004 [2019-09-08 10:17:00,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2019-09-08 10:17:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5998. [2019-09-08 10:17:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5998 states. [2019-09-08 10:17:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5998 states to 5998 states and 7863 transitions. [2019-09-08 10:17:00,905 INFO L78 Accepts]: Start accepts. Automaton has 5998 states and 7863 transitions. Word has length 60 [2019-09-08 10:17:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:00,905 INFO L475 AbstractCegarLoop]: Abstraction has 5998 states and 7863 transitions. [2019-09-08 10:17:00,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5998 states and 7863 transitions. [2019-09-08 10:17:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:17:00,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:00,912 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] [2019-09-08 10:17:00,912 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-09-08 10:17:00,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:00,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:00,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:00,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:00,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:01,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:01,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:01,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:01,005 INFO L87 Difference]: Start difference. First operand 5998 states and 7863 transitions. Second operand 3 states. [2019-09-08 10:17:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:01,607 INFO L93 Difference]: Finished difference Result 9500 states and 13162 transitions. [2019-09-08 10:17:01,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:01,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:17:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:01,625 INFO L225 Difference]: With dead ends: 9500 [2019-09-08 10:17:01,625 INFO L226 Difference]: Without dead ends: 7094 [2019-09-08 10:17:01,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2019-09-08 10:17:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 6490. [2019-09-08 10:17:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-09-08 10:17:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 8682 transitions. [2019-09-08 10:17:02,106 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 8682 transitions. Word has length 60 [2019-09-08 10:17:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:02,107 INFO L475 AbstractCegarLoop]: Abstraction has 6490 states and 8682 transitions. [2019-09-08 10:17:02,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 8682 transitions. [2019-09-08 10:17:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:17:02,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:02,112 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] [2019-09-08 10:17:02,112 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-09-08 10:17:02,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:02,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:02,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:02,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:02,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:02,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:02,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:02,197 INFO L87 Difference]: Start difference. First operand 6490 states and 8682 transitions. Second operand 3 states. [2019-09-08 10:17:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:03,108 INFO L93 Difference]: Finished difference Result 11804 states and 16581 transitions. [2019-09-08 10:17:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:03,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:17:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:03,127 INFO L225 Difference]: With dead ends: 11804 [2019-09-08 10:17:03,128 INFO L226 Difference]: Without dead ends: 8405 [2019-09-08 10:17:03,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8405 states. [2019-09-08 10:17:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8405 to 7489. [2019-09-08 10:17:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7489 states. [2019-09-08 10:17:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 10153 transitions. [2019-09-08 10:17:03,723 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 10153 transitions. Word has length 60 [2019-09-08 10:17:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:03,724 INFO L475 AbstractCegarLoop]: Abstraction has 7489 states and 10153 transitions. [2019-09-08 10:17:03,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 10153 transitions. [2019-09-08 10:17:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:17:03,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:03,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:03,728 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:03,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-09-08 10:17:03,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:03,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:03,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:03,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:03,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:03,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:03,804 INFO L87 Difference]: Start difference. First operand 7489 states and 10153 transitions. Second operand 3 states. [2019-09-08 10:17:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:05,143 INFO L93 Difference]: Finished difference Result 15674 states and 22068 transitions. [2019-09-08 10:17:05,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:05,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:17:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:05,166 INFO L225 Difference]: With dead ends: 15674 [2019-09-08 10:17:05,167 INFO L226 Difference]: Without dead ends: 9967 [2019-09-08 10:17:05,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9967 states. [2019-09-08 10:17:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9967 to 8100. [2019-09-08 10:17:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-08 10:17:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 11278 transitions. [2019-09-08 10:17:05,835 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 11278 transitions. Word has length 61 [2019-09-08 10:17:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:05,836 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 11278 transitions. [2019-09-08 10:17:05,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 11278 transitions. [2019-09-08 10:17:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:17:05,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:05,839 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] [2019-09-08 10:17:05,839 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-09-08 10:17:05,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:05,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:05,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:05,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:05,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:06,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:06,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:17:06,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:17:06,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:17:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:17:06,318 INFO L87 Difference]: Start difference. First operand 8100 states and 11278 transitions. Second operand 12 states. [2019-09-08 10:17:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:09,618 INFO L93 Difference]: Finished difference Result 18194 states and 25969 transitions. [2019-09-08 10:17:09,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:17:09,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-08 10:17:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:09,660 INFO L225 Difference]: With dead ends: 18194 [2019-09-08 10:17:09,661 INFO L226 Difference]: Without dead ends: 17815 [2019-09-08 10:17:09,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:17:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17815 states. [2019-09-08 10:17:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17815 to 8099. [2019-09-08 10:17:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8099 states. [2019-09-08 10:17:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8099 states to 8099 states and 11276 transitions. [2019-09-08 10:17:10,479 INFO L78 Accepts]: Start accepts. Automaton has 8099 states and 11276 transitions. Word has length 61 [2019-09-08 10:17:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:10,479 INFO L475 AbstractCegarLoop]: Abstraction has 8099 states and 11276 transitions. [2019-09-08 10:17:10,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:17:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 8099 states and 11276 transitions. [2019-09-08 10:17:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:17:10,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:10,481 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] [2019-09-08 10:17:10,482 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash -169233154, now seen corresponding path program 1 times [2019-09-08 10:17:10,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:10,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:10,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:10,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:10,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:10,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:10,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:10,554 INFO L87 Difference]: Start difference. First operand 8099 states and 11276 transitions. Second operand 3 states. [2019-09-08 10:17:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:11,797 INFO L93 Difference]: Finished difference Result 19005 states and 27185 transitions. [2019-09-08 10:17:11,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:11,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:17:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:11,820 INFO L225 Difference]: With dead ends: 19005 [2019-09-08 10:17:11,820 INFO L226 Difference]: Without dead ends: 12086 [2019-09-08 10:17:11,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12086 states. [2019-09-08 10:17:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12086 to 9573. [2019-09-08 10:17:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9573 states. [2019-09-08 10:17:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9573 states to 9573 states and 13606 transitions. [2019-09-08 10:17:12,962 INFO L78 Accepts]: Start accepts. Automaton has 9573 states and 13606 transitions. Word has length 61 [2019-09-08 10:17:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:12,962 INFO L475 AbstractCegarLoop]: Abstraction has 9573 states and 13606 transitions. [2019-09-08 10:17:12,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9573 states and 13606 transitions. [2019-09-08 10:17:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:17:12,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:12,964 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] [2019-09-08 10:17:12,964 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 58994233, now seen corresponding path program 1 times [2019-09-08 10:17:12,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:12,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:12,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:13,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:13,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:13,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:13,047 INFO L87 Difference]: Start difference. First operand 9573 states and 13606 transitions. Second operand 3 states. [2019-09-08 10:17:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:14,094 INFO L93 Difference]: Finished difference Result 20090 states and 28827 transitions. [2019-09-08 10:17:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:17:14,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:17:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:14,108 INFO L225 Difference]: With dead ends: 20090 [2019-09-08 10:17:14,108 INFO L226 Difference]: Without dead ends: 10943 [2019-09-08 10:17:14,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10943 states. [2019-09-08 10:17:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10943 to 8868. [2019-09-08 10:17:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8868 states. [2019-09-08 10:17:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8868 states to 8868 states and 12687 transitions. [2019-09-08 10:17:15,152 INFO L78 Accepts]: Start accepts. Automaton has 8868 states and 12687 transitions. Word has length 61 [2019-09-08 10:17:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:15,153 INFO L475 AbstractCegarLoop]: Abstraction has 8868 states and 12687 transitions. [2019-09-08 10:17:15,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 8868 states and 12687 transitions. [2019-09-08 10:17:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:17:15,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:15,154 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] [2019-09-08 10:17:15,154 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash -244084559, now seen corresponding path program 1 times [2019-09-08 10:17:15,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:15,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:15,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:15,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:15,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:15,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:17:15,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:17:15,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:17:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:17:15,809 INFO L87 Difference]: Start difference. First operand 8868 states and 12687 transitions. Second operand 13 states. [2019-09-08 10:17:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:19,750 INFO L93 Difference]: Finished difference Result 15229 states and 21840 transitions. [2019-09-08 10:17:19,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:17:19,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-08 10:17:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:19,768 INFO L225 Difference]: With dead ends: 15229 [2019-09-08 10:17:19,768 INFO L226 Difference]: Without dead ends: 15225 [2019-09-08 10:17:19,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:17:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-09-08 10:17:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 8868. [2019-09-08 10:17:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8868 states. [2019-09-08 10:17:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8868 states to 8868 states and 12686 transitions. [2019-09-08 10:17:20,634 INFO L78 Accepts]: Start accepts. Automaton has 8868 states and 12686 transitions. Word has length 62 [2019-09-08 10:17:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:20,634 INFO L475 AbstractCegarLoop]: Abstraction has 8868 states and 12686 transitions. [2019-09-08 10:17:20,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:17:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 8868 states and 12686 transitions. [2019-09-08 10:17:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:17:20,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:20,636 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] [2019-09-08 10:17:20,636 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash 271982167, now seen corresponding path program 1 times [2019-09-08 10:17:20,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:20,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:20,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:21,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:21,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:17:21,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:17:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:17:21,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:17:21,268 INFO L87 Difference]: Start difference. First operand 8868 states and 12686 transitions. Second operand 14 states. [2019-09-08 10:17:22,462 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-08 10:17:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:27,261 INFO L93 Difference]: Finished difference Result 20583 states and 29508 transitions. [2019-09-08 10:17:27,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:17:27,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-09-08 10:17:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:27,286 INFO L225 Difference]: With dead ends: 20583 [2019-09-08 10:17:27,286 INFO L226 Difference]: Without dead ends: 20137 [2019-09-08 10:17:27,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:17:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20137 states. [2019-09-08 10:17:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20137 to 8804. [2019-09-08 10:17:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8804 states. [2019-09-08 10:17:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 12607 transitions. [2019-09-08 10:17:28,279 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 12607 transitions. Word has length 62 [2019-09-08 10:17:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:28,279 INFO L475 AbstractCegarLoop]: Abstraction has 8804 states and 12607 transitions. [2019-09-08 10:17:28,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:17:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 12607 transitions. [2019-09-08 10:17:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:17:28,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:28,281 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] [2019-09-08 10:17:28,281 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2056344142, now seen corresponding path program 1 times [2019-09-08 10:17:28,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:28,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:28,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:29,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 10:17:29,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:29,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:17:29,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:17:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:17:29,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:17:29,140 INFO L87 Difference]: Start difference. First operand 8804 states and 12607 transitions. Second operand 14 states. [2019-09-08 10:17:29,650 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-08 10:17:30,232 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-08 10:17:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:34,512 INFO L93 Difference]: Finished difference Result 20387 states and 29361 transitions. [2019-09-08 10:17:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:17:34,513 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-09-08 10:17:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:34,539 INFO L225 Difference]: With dead ends: 20387 [2019-09-08 10:17:34,539 INFO L226 Difference]: Without dead ends: 20383 [2019-09-08 10:17:34,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:17:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20383 states. [2019-09-08 10:17:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20383 to 8800. [2019-09-08 10:17:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8800 states. [2019-09-08 10:17:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8800 states to 8800 states and 12603 transitions. [2019-09-08 10:17:35,662 INFO L78 Accepts]: Start accepts. Automaton has 8800 states and 12603 transitions. Word has length 63 [2019-09-08 10:17:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:35,662 INFO L475 AbstractCegarLoop]: Abstraction has 8800 states and 12603 transitions. [2019-09-08 10:17:35,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:17:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8800 states and 12603 transitions. [2019-09-08 10:17:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:17:35,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:35,664 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] [2019-09-08 10:17:35,664 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:35,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1004192523, now seen corresponding path program 1 times [2019-09-08 10:17:35,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:35,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:36,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:36,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:17:36,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:17:36,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:17:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:17:36,360 INFO L87 Difference]: Start difference. First operand 8800 states and 12603 transitions. Second operand 16 states. [2019-09-08 10:17:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:40,417 INFO L93 Difference]: Finished difference Result 11483 states and 16368 transitions. [2019-09-08 10:17:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:17:40,418 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-09-08 10:17:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:40,430 INFO L225 Difference]: With dead ends: 11483 [2019-09-08 10:17:40,431 INFO L226 Difference]: Without dead ends: 11052 [2019-09-08 10:17:40,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:17:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11052 states. [2019-09-08 10:17:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11052 to 8755. [2019-09-08 10:17:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-09-08 10:17:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 12543 transitions. [2019-09-08 10:17:41,429 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 12543 transitions. Word has length 63 [2019-09-08 10:17:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:41,430 INFO L475 AbstractCegarLoop]: Abstraction has 8755 states and 12543 transitions. [2019-09-08 10:17:41,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:17:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 12543 transitions. [2019-09-08 10:17:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:17:41,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:41,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:41,433 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2123353110, now seen corresponding path program 1 times [2019-09-08 10:17:41,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:41,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:41,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:41,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:41,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:17:41,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:17:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:17:41,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:17:41,554 INFO L87 Difference]: Start difference. First operand 8755 states and 12543 transitions. Second operand 6 states. [2019-09-08 10:17:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:46,027 INFO L93 Difference]: Finished difference Result 38061 states and 54940 transitions. [2019-09-08 10:17:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:17:46,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:17:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:46,069 INFO L225 Difference]: With dead ends: 38061 [2019-09-08 10:17:46,069 INFO L226 Difference]: Without dead ends: 30233 [2019-09-08 10:17:46,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:17:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30233 states. [2019-09-08 10:17:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30233 to 26561. [2019-09-08 10:17:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26561 states. [2019-09-08 10:17:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26561 states to 26561 states and 37422 transitions. [2019-09-08 10:17:50,411 INFO L78 Accepts]: Start accepts. Automaton has 26561 states and 37422 transitions. Word has length 70 [2019-09-08 10:17:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:50,411 INFO L475 AbstractCegarLoop]: Abstraction has 26561 states and 37422 transitions. [2019-09-08 10:17:50,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:17:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26561 states and 37422 transitions. [2019-09-08 10:17:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:17:50,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:50,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:50,415 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:50,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1078555367, now seen corresponding path program 1 times [2019-09-08 10:17:50,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:50,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:50,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:50,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:50,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:17:50,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:17:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:17:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:17:50,514 INFO L87 Difference]: Start difference. First operand 26561 states and 37422 transitions. Second operand 5 states. [2019-09-08 10:17:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:54,391 INFO L93 Difference]: Finished difference Result 50365 states and 71135 transitions. [2019-09-08 10:17:54,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:17:54,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:17:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:54,424 INFO L225 Difference]: With dead ends: 50365 [2019-09-08 10:17:54,424 INFO L226 Difference]: Without dead ends: 24729 [2019-09-08 10:17:54,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:17:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24729 states. [2019-09-08 10:17:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24729 to 24725. [2019-09-08 10:17:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24725 states. [2019-09-08 10:17:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24725 states to 24725 states and 34770 transitions. [2019-09-08 10:17:58,073 INFO L78 Accepts]: Start accepts. Automaton has 24725 states and 34770 transitions. Word has length 71 [2019-09-08 10:17:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:58,073 INFO L475 AbstractCegarLoop]: Abstraction has 24725 states and 34770 transitions. [2019-09-08 10:17:58,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:17:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24725 states and 34770 transitions. [2019-09-08 10:17:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:17:58,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:58,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:58,077 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:58,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash 781945202, now seen corresponding path program 1 times [2019-09-08 10:17:58,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:58,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:58,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:58,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:58,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:58,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:58,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:17:58,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:17:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:17:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:17:58,183 INFO L87 Difference]: Start difference. First operand 24725 states and 34770 transitions. Second operand 6 states. [2019-09-08 10:18:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:05,643 INFO L93 Difference]: Finished difference Result 43425 states and 60368 transitions. [2019-09-08 10:18:05,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:18:05,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-08 10:18:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:05,698 INFO L225 Difference]: With dead ends: 43425 [2019-09-08 10:18:05,698 INFO L226 Difference]: Without dead ends: 43423 [2019-09-08 10:18:05,709 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 10:18:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43423 states. [2019-09-08 10:18:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43423 to 25541. [2019-09-08 10:18:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25541 states. [2019-09-08 10:18:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25541 states to 25541 states and 35404 transitions. [2019-09-08 10:18:09,667 INFO L78 Accepts]: Start accepts. Automaton has 25541 states and 35404 transitions. Word has length 73 [2019-09-08 10:18:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:09,667 INFO L475 AbstractCegarLoop]: Abstraction has 25541 states and 35404 transitions. [2019-09-08 10:18:09,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:18:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 25541 states and 35404 transitions. [2019-09-08 10:18:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:18:09,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:09,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:09,672 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:09,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1414482205, now seen corresponding path program 1 times [2019-09-08 10:18:09,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:09,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:09,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:09,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:09,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:09,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:09,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:09,750 INFO L87 Difference]: Start difference. First operand 25541 states and 35404 transitions. Second operand 3 states. [2019-09-08 10:18:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:16,629 INFO L93 Difference]: Finished difference Result 68505 states and 95127 transitions. [2019-09-08 10:18:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:16,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:18:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:16,696 INFO L225 Difference]: With dead ends: 68505 [2019-09-08 10:18:16,696 INFO L226 Difference]: Without dead ends: 43889 [2019-09-08 10:18:16,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43889 states. [2019-09-08 10:18:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43889 to 43887. [2019-09-08 10:18:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43887 states. [2019-09-08 10:18:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43887 states to 43887 states and 60327 transitions. [2019-09-08 10:18:24,683 INFO L78 Accepts]: Start accepts. Automaton has 43887 states and 60327 transitions. Word has length 74 [2019-09-08 10:18:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:24,683 INFO L475 AbstractCegarLoop]: Abstraction has 43887 states and 60327 transitions. [2019-09-08 10:18:24,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 43887 states and 60327 transitions. [2019-09-08 10:18:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:18:24,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:24,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:24,689 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1190739596, now seen corresponding path program 1 times [2019-09-08 10:18:24,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:24,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:24,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:24,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:24,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:18:24,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:18:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:18:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:18:24,803 INFO L87 Difference]: Start difference. First operand 43887 states and 60327 transitions. Second operand 5 states. [2019-09-08 10:18:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:45,161 INFO L93 Difference]: Finished difference Result 155726 states and 213970 transitions. [2019-09-08 10:18:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:18:45,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 10:18:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:45,380 INFO L225 Difference]: With dead ends: 155726 [2019-09-08 10:18:45,381 INFO L226 Difference]: Without dead ends: 112689 [2019-09-08 10:18:45,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:18:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112689 states. [2019-09-08 10:18:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112689 to 43454. [2019-09-08 10:18:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43454 states. [2019-09-08 10:18:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43454 states to 43454 states and 58919 transitions. [2019-09-08 10:18:54,941 INFO L78 Accepts]: Start accepts. Automaton has 43454 states and 58919 transitions. Word has length 76 [2019-09-08 10:18:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:54,942 INFO L475 AbstractCegarLoop]: Abstraction has 43454 states and 58919 transitions. [2019-09-08 10:18:54,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:18:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 43454 states and 58919 transitions. [2019-09-08 10:18:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:18:54,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:54,947 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 10:18:54,947 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2062750855, now seen corresponding path program 1 times [2019-09-08 10:18:54,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:54,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:54,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:54,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:54,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:55,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:55,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:55,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:55,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:55,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:55,038 INFO L87 Difference]: Start difference. First operand 43454 states and 58919 transitions. Second operand 3 states. [2019-09-08 10:19:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:02,110 INFO L93 Difference]: Finished difference Result 56526 states and 76525 transitions. [2019-09-08 10:19:02,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:02,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:19:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:02,159 INFO L225 Difference]: With dead ends: 56526 [2019-09-08 10:19:02,159 INFO L226 Difference]: Without dead ends: 43456 [2019-09-08 10:19:02,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43456 states. [2019-09-08 10:19:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43456 to 34476. [2019-09-08 10:19:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34476 states. [2019-09-08 10:19:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34476 states to 34476 states and 46147 transitions. [2019-09-08 10:19:08,476 INFO L78 Accepts]: Start accepts. Automaton has 34476 states and 46147 transitions. Word has length 77 [2019-09-08 10:19:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:08,476 INFO L475 AbstractCegarLoop]: Abstraction has 34476 states and 46147 transitions. [2019-09-08 10:19:08,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 34476 states and 46147 transitions. [2019-09-08 10:19:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:19:08,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:08,481 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 10:19:08,481 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash -667932309, now seen corresponding path program 1 times [2019-09-08 10:19:08,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:08,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:08,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:08,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:08,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:19:08,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:19:08,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:19:08,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:08,570 INFO L87 Difference]: Start difference. First operand 34476 states and 46147 transitions. Second operand 5 states. [2019-09-08 10:19:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:31,812 INFO L93 Difference]: Finished difference Result 143111 states and 191033 transitions. [2019-09-08 10:19:31,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:19:31,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 10:19:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:31,989 INFO L225 Difference]: With dead ends: 143111 [2019-09-08 10:19:31,989 INFO L226 Difference]: Without dead ends: 109530 [2019-09-08 10:19:32,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:19:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109530 states. [2019-09-08 10:19:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109530 to 58161. [2019-09-08 10:19:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58161 states. [2019-09-08 10:19:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58161 states to 58161 states and 77381 transitions. [2019-09-08 10:19:43,577 INFO L78 Accepts]: Start accepts. Automaton has 58161 states and 77381 transitions. Word has length 78 [2019-09-08 10:19:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:43,577 INFO L475 AbstractCegarLoop]: Abstraction has 58161 states and 77381 transitions. [2019-09-08 10:19:43,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:19:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 58161 states and 77381 transitions. [2019-09-08 10:19:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:19:43,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:43,583 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] [2019-09-08 10:19:43,583 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1157971312, now seen corresponding path program 1 times [2019-09-08 10:19:43,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:43,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:43,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:43,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:43,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:43,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:19:43,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:19:43,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:19:43,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:43,666 INFO L87 Difference]: Start difference. First operand 58161 states and 77381 transitions. Second operand 5 states. [2019-09-08 10:20:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:21,748 INFO L93 Difference]: Finished difference Result 230781 states and 306416 transitions. [2019-09-08 10:20:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:20:21,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 10:20:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:22,003 INFO L225 Difference]: With dead ends: 230781 [2019-09-08 10:20:22,003 INFO L226 Difference]: Without dead ends: 173493 [2019-09-08 10:20:22,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:20:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173493 states. [2019-09-08 10:20:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173493 to 115443. [2019-09-08 10:20:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115443 states. [2019-09-08 10:20:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115443 states to 115443 states and 152489 transitions. [2019-09-08 10:20:47,409 INFO L78 Accepts]: Start accepts. Automaton has 115443 states and 152489 transitions. Word has length 81 [2019-09-08 10:20:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:47,409 INFO L475 AbstractCegarLoop]: Abstraction has 115443 states and 152489 transitions. [2019-09-08 10:20:47,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:20:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 115443 states and 152489 transitions. [2019-09-08 10:20:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:20:47,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:47,415 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] [2019-09-08 10:20:47,415 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2119187877, now seen corresponding path program 1 times [2019-09-08 10:20:47,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:47,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:47,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:47,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:47,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:47,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:47,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:47,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:47,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:47,503 INFO L87 Difference]: Start difference. First operand 115443 states and 152489 transitions. Second operand 3 states. [2019-09-08 10:21:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:32,077 INFO L93 Difference]: Finished difference Result 321615 states and 423535 transitions. [2019-09-08 10:21:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:21:32,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:21:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:32,387 INFO L225 Difference]: With dead ends: 321615 [2019-09-08 10:21:32,387 INFO L226 Difference]: Without dead ends: 207065 [2019-09-08 10:21:32,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:21:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207065 states. [2019-09-08 10:22:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207065 to 148681. [2019-09-08 10:22:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148681 states. [2019-09-08 10:22:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148681 states to 148681 states and 192781 transitions. [2019-09-08 10:22:07,030 INFO L78 Accepts]: Start accepts. Automaton has 148681 states and 192781 transitions. Word has length 83 [2019-09-08 10:22:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:07,030 INFO L475 AbstractCegarLoop]: Abstraction has 148681 states and 192781 transitions. [2019-09-08 10:22:07,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:22:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 148681 states and 192781 transitions. [2019-09-08 10:22:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 10:22:07,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:07,037 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 10:22:07,037 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1236526896, now seen corresponding path program 1 times [2019-09-08 10:22:07,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:07,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:07,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:22:07,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:07,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:22:07,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:22:07,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:22:07,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:22:07,127 INFO L87 Difference]: Start difference. First operand 148681 states and 192781 transitions. Second operand 3 states. [2019-09-08 10:22:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:50,965 INFO L93 Difference]: Finished difference Result 337403 states and 436565 transitions. [2019-09-08 10:22:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:22:50,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 10:22:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:51,290 INFO L225 Difference]: With dead ends: 337403 [2019-09-08 10:22:51,290 INFO L226 Difference]: Without dead ends: 189603 [2019-09-08 10:22:51,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:22:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189603 states. [2019-09-08 10:23:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189603 to 148713. [2019-09-08 10:23:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148713 states. [2019-09-08 10:23:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148713 states to 148713 states and 189807 transitions. [2019-09-08 10:23:28,313 INFO L78 Accepts]: Start accepts. Automaton has 148713 states and 189807 transitions. Word has length 86 [2019-09-08 10:23:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:28,313 INFO L475 AbstractCegarLoop]: Abstraction has 148713 states and 189807 transitions. [2019-09-08 10:23:28,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 148713 states and 189807 transitions. [2019-09-08 10:23:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 10:23:28,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:28,318 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 10:23:28,318 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1275937295, now seen corresponding path program 1 times [2019-09-08 10:23:28,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:28,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:28,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:28,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:28,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:28,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:28,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:28,411 INFO L87 Difference]: Start difference. First operand 148713 states and 189807 transitions. Second operand 3 states. [2019-09-08 10:24:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:12,205 INFO L93 Difference]: Finished difference Result 327265 states and 416619 transitions. [2019-09-08 10:24:12,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:12,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 10:24:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:12,482 INFO L225 Difference]: With dead ends: 327265 [2019-09-08 10:24:12,482 INFO L226 Difference]: Without dead ends: 179361 [2019-09-08 10:24:12,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179361 states. [2019-09-08 10:24:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179361 to 169809. [2019-09-08 10:24:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169809 states. [2019-09-08 10:24:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169809 states to 169809 states and 213469 transitions. [2019-09-08 10:24:49,389 INFO L78 Accepts]: Start accepts. Automaton has 169809 states and 213469 transitions. Word has length 89 [2019-09-08 10:24:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:49,389 INFO L475 AbstractCegarLoop]: Abstraction has 169809 states and 213469 transitions. [2019-09-08 10:24:49,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 169809 states and 213469 transitions. [2019-09-08 10:24:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:24:49,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:49,400 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:24:49,401 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash -383116103, now seen corresponding path program 1 times [2019-09-08 10:24:49,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:49,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:49,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:24:49,558 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) [2019-09-08 10:24:49,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:24:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:49,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 10:24:49,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:24:49,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:24:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:24:50,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:24:50,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 10:24:50,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:24:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:24:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:24:50,304 INFO L87 Difference]: Start difference. First operand 169809 states and 213469 transitions. Second operand 13 states. [2019-09-08 10:26:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:38,188 INFO L93 Difference]: Finished difference Result 582092 states and 733304 transitions. [2019-09-08 10:26:38,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:26:38,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-08 10:26:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:39,372 INFO L225 Difference]: With dead ends: 582092 [2019-09-08 10:26:39,372 INFO L226 Difference]: Without dead ends: 413092 [2019-09-08 10:26:39,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=400, Invalid=1160, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:26:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413092 states. [2019-09-08 10:27:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413092 to 218707. [2019-09-08 10:27:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218707 states. [2019-09-08 10:27:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218707 states to 218707 states and 274677 transitions. [2019-09-08 10:27:42,580 INFO L78 Accepts]: Start accepts. Automaton has 218707 states and 274677 transitions. Word has length 97 [2019-09-08 10:27:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:42,581 INFO L475 AbstractCegarLoop]: Abstraction has 218707 states and 274677 transitions. [2019-09-08 10:27:42,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:27:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 218707 states and 274677 transitions. [2019-09-08 10:27:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:27:42,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:42,607 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:27:42,608 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2107665468, now seen corresponding path program 1 times [2019-09-08 10:27:42,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:42,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:42,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:42,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:42,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:42,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:42,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:27:42,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:27:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:27:42,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:42,711 INFO L87 Difference]: Start difference. First operand 218707 states and 274677 transitions. Second operand 3 states. [2019-09-08 10:28:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:38,882 INFO L93 Difference]: Finished difference Result 314203 states and 393908 transitions. [2019-09-08 10:28:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:28:38,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 10:28:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:39,319 INFO L225 Difference]: With dead ends: 314203 [2019-09-08 10:28:39,320 INFO L226 Difference]: Without dead ends: 215142 [2019-09-08 10:28:39,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:28:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215142 states. [2019-09-08 10:29:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215142 to 214948. [2019-09-08 10:29:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214948 states. [2019-09-08 10:29:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214948 states to 214948 states and 267550 transitions. [2019-09-08 10:29:31,972 INFO L78 Accepts]: Start accepts. Automaton has 214948 states and 267550 transitions. Word has length 98 [2019-09-08 10:29:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:31,972 INFO L475 AbstractCegarLoop]: Abstraction has 214948 states and 267550 transitions. [2019-09-08 10:29:31,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 214948 states and 267550 transitions. [2019-09-08 10:29:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:29:31,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:31,981 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:29:31,981 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1350911043, now seen corresponding path program 1 times [2019-09-08 10:29:31,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:31,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:32,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:32,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:32,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:32,077 INFO L87 Difference]: Start difference. First operand 214948 states and 267550 transitions. Second operand 5 states.