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.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:19:17,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:19:17,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:19:17,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:19:17,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:19:17,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:19:17,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:19:17,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:19:17,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:19:17,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:19:17,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:19:17,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:19:17,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:19:17,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:19:17,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:19:17,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:19:17,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:19:17,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:19:17,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:19:17,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:19:17,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:19:17,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:19:18,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:19:18,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:19:18,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:19:18,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:19:18,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:19:18,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:19:18,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:19:18,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:19:18,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:19:18,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:19:18,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:19:18,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:19:18,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:19:18,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:19:18,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:19:18,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:19:18,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:19:18,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:19:18,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:19:18,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:19:18,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:19:18,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:19:18,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:19:18,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:19:18,041 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:19:18,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:19:18,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:19:18,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:19:18,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:19:18,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:19:18,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:19:18,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:19:18,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:19:18,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:19:18,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:19:18,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:19:18,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:19:18,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:19:18,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:19:18,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:19:18,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:19:18,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:19:18,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:19:18,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:19:18,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:19:18,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:19:18,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:19:18,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:19:18,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:19:18,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:19:18,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:19:18,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:19:18,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:19:18,125 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:19:18,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:19:18,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae38ff77/1d1206a3fbc940dbb3dc09c01df8e383/FLAG3099b2316 [2019-09-08 12:19:18,737 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:19:18,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:19:18,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae38ff77/1d1206a3fbc940dbb3dc09c01df8e383/FLAG3099b2316 [2019-09-08 12:19:19,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ae38ff77/1d1206a3fbc940dbb3dc09c01df8e383 [2019-09-08 12:19:19,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:19:19,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:19:19,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:19:19,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:19:19,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:19:19,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ff82d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19, skipping insertion in model container [2019-09-08 12:19:19,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,034 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:19:19,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:19:19,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:19:19,632 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:19:19,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:19:19,769 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:19:19,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19 WrapperNode [2019-09-08 12:19:19,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:19:19,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:19:19,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:19:19,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:19:19,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... [2019-09-08 12:19:19,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:19:19,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:19:19,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:19:19,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:19:19,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:19:19,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:19:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:19:19,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:19:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:19:19,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:19:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:19:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:19:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:19:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:19:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:19:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:19:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:19:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:19:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:19:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:19:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:19:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:19:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:19:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:19:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:19:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:19:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:19:21,267 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:19:21,268 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:19:21,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:19:21 BoogieIcfgContainer [2019-09-08 12:19:21,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:19:21,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:19:21,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:19:21,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:19:21,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:19:19" (1/3) ... [2019-09-08 12:19:21,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3f6c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:19:21, skipping insertion in model container [2019-09-08 12:19:21,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:19:19" (2/3) ... [2019-09-08 12:19:21,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3f6c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:19:21, skipping insertion in model container [2019-09-08 12:19:21,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:19:21" (3/3) ... [2019-09-08 12:19:21,278 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:19:21,288 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:19:21,296 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:19:21,318 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:19:21,357 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:19:21,358 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:19:21,358 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:19:21,358 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:19:21,359 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:19:21,359 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:19:21,359 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:19:21,359 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:19:21,359 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:19:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states. [2019-09-08 12:19:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:19:21,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:21,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:21,397 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:21,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:21,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1532113436, now seen corresponding path program 1 times [2019-09-08 12:19:21,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:21,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:21,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:21,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:21,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:21,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:21,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:19:21,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:19:21,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:19:21,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:19:21,838 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 4 states. [2019-09-08 12:19:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:22,005 INFO L93 Difference]: Finished difference Result 480 states and 778 transitions. [2019-09-08 12:19:22,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:22,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-08 12:19:22,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:22,023 INFO L225 Difference]: With dead ends: 480 [2019-09-08 12:19:22,023 INFO L226 Difference]: Without dead ends: 258 [2019-09-08 12:19:22,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-08 12:19:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-09-08 12:19:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-08 12:19:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 384 transitions. [2019-09-08 12:19:22,109 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 384 transitions. Word has length 95 [2019-09-08 12:19:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:22,109 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 384 transitions. [2019-09-08 12:19:22,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:19:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 384 transitions. [2019-09-08 12:19:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:19:22,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:22,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:22,119 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash 490754805, now seen corresponding path program 1 times [2019-09-08 12:19:22,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:22,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:22,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:22,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:22,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:22,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:22,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:22,366 INFO L87 Difference]: Start difference. First operand 258 states and 384 transitions. Second operand 3 states. [2019-09-08 12:19:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:22,464 INFO L93 Difference]: Finished difference Result 559 states and 864 transitions. [2019-09-08 12:19:22,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:22,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-09-08 12:19:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:22,472 INFO L225 Difference]: With dead ends: 559 [2019-09-08 12:19:22,472 INFO L226 Difference]: Without dead ends: 366 [2019-09-08 12:19:22,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-08 12:19:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-09-08 12:19:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-08 12:19:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2019-09-08 12:19:22,523 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 134 [2019-09-08 12:19:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:22,524 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2019-09-08 12:19:22,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2019-09-08 12:19:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:19:22,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:22,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:22,528 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:22,529 INFO L82 PathProgramCache]: Analyzing trace with hash 667997316, now seen corresponding path program 1 times [2019-09-08 12:19:22,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:22,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:22,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:22,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:22,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:22,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:22,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:22,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:22,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:22,743 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand 3 states. [2019-09-08 12:19:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:22,796 INFO L93 Difference]: Finished difference Result 847 states and 1323 transitions. [2019-09-08 12:19:22,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:22,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 12:19:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:22,811 INFO L225 Difference]: With dead ends: 847 [2019-09-08 12:19:22,811 INFO L226 Difference]: Without dead ends: 554 [2019-09-08 12:19:22,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-08 12:19:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-09-08 12:19:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-08 12:19:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 850 transitions. [2019-09-08 12:19:22,853 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 850 transitions. Word has length 136 [2019-09-08 12:19:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:22,853 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 850 transitions. [2019-09-08 12:19:22,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:22,854 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 850 transitions. [2019-09-08 12:19:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:19:22,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:22,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:22,857 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash -98161070, now seen corresponding path program 1 times [2019-09-08 12:19:22,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:22,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:22,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:22,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:22,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:22,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:23,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:23,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:23,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:23,002 INFO L87 Difference]: Start difference. First operand 552 states and 850 transitions. Second operand 3 states. [2019-09-08 12:19:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:23,072 INFO L93 Difference]: Finished difference Result 1353 states and 2127 transitions. [2019-09-08 12:19:23,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:23,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:19:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:23,081 INFO L225 Difference]: With dead ends: 1353 [2019-09-08 12:19:23,081 INFO L226 Difference]: Without dead ends: 878 [2019-09-08 12:19:23,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-09-08 12:19:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2019-09-08 12:19:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-08 12:19:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1362 transitions. [2019-09-08 12:19:23,136 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1362 transitions. Word has length 138 [2019-09-08 12:19:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:23,136 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1362 transitions. [2019-09-08 12:19:23,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1362 transitions. [2019-09-08 12:19:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:19:23,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:23,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:23,141 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1548373260, now seen corresponding path program 1 times [2019-09-08 12:19:23,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:23,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:23,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 12:19:23,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:23,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:23,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:23,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:23,308 INFO L87 Difference]: Start difference. First operand 876 states and 1362 transitions. Second operand 3 states. [2019-09-08 12:19:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:23,392 INFO L93 Difference]: Finished difference Result 2211 states and 3483 transitions. [2019-09-08 12:19:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:23,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 12:19:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:23,403 INFO L225 Difference]: With dead ends: 2211 [2019-09-08 12:19:23,404 INFO L226 Difference]: Without dead ends: 1418 [2019-09-08 12:19:23,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-09-08 12:19:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1416. [2019-09-08 12:19:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-08 12:19:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2210 transitions. [2019-09-08 12:19:23,483 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2210 transitions. Word has length 140 [2019-09-08 12:19:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:23,484 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2210 transitions. [2019-09-08 12:19:23,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2210 transitions. [2019-09-08 12:19:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:19:23,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:23,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:23,489 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1337291477, now seen corresponding path program 1 times [2019-09-08 12:19:23,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:23,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:23,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:23,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:23,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:23,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:23,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:23,588 INFO L87 Difference]: Start difference. First operand 1416 states and 2210 transitions. Second operand 3 states. [2019-09-08 12:19:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:23,750 INFO L93 Difference]: Finished difference Result 3605 states and 5667 transitions. [2019-09-08 12:19:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:23,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:19:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:23,768 INFO L225 Difference]: With dead ends: 3605 [2019-09-08 12:19:23,769 INFO L226 Difference]: Without dead ends: 2278 [2019-09-08 12:19:23,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-09-08 12:19:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-09-08 12:19:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-09-08 12:19:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3546 transitions. [2019-09-08 12:19:23,934 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3546 transitions. Word has length 142 [2019-09-08 12:19:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:23,937 INFO L475 AbstractCegarLoop]: Abstraction has 2276 states and 3546 transitions. [2019-09-08 12:19:23,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3546 transitions. [2019-09-08 12:19:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:23,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:23,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:23,949 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 911413393, now seen corresponding path program 1 times [2019-09-08 12:19:23,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:23,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:24,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:24,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:24,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:24,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:24,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:24,099 INFO L87 Difference]: Start difference. First operand 2276 states and 3546 transitions. Second operand 3 states. [2019-09-08 12:19:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:24,696 INFO L93 Difference]: Finished difference Result 6355 states and 9935 transitions. [2019-09-08 12:19:24,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:24,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:19:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:24,722 INFO L225 Difference]: With dead ends: 6355 [2019-09-08 12:19:24,722 INFO L226 Difference]: Without dead ends: 4472 [2019-09-08 12:19:24,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2019-09-08 12:19:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 4470. [2019-09-08 12:19:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2019-09-08 12:19:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 6968 transitions. [2019-09-08 12:19:25,010 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 6968 transitions. Word has length 144 [2019-09-08 12:19:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:25,011 INFO L475 AbstractCegarLoop]: Abstraction has 4470 states and 6968 transitions. [2019-09-08 12:19:25,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 6968 transitions. [2019-09-08 12:19:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:25,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:25,024 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:25,025 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash -621452074, now seen corresponding path program 1 times [2019-09-08 12:19:25,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:25,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:25,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:25,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:25,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:25,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:25,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:25,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:25,122 INFO L87 Difference]: Start difference. First operand 4470 states and 6968 transitions. Second operand 3 states. [2019-09-08 12:19:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:25,823 INFO L93 Difference]: Finished difference Result 12427 states and 19369 transitions. [2019-09-08 12:19:25,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:25,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:19:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:25,868 INFO L225 Difference]: With dead ends: 12427 [2019-09-08 12:19:25,868 INFO L226 Difference]: Without dead ends: 8793 [2019-09-08 12:19:25,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2019-09-08 12:19:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 8791. [2019-09-08 12:19:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8791 states. [2019-09-08 12:19:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8791 states to 8791 states and 13671 transitions. [2019-09-08 12:19:26,313 INFO L78 Accepts]: Start accepts. Automaton has 8791 states and 13671 transitions. Word has length 144 [2019-09-08 12:19:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:26,313 INFO L475 AbstractCegarLoop]: Abstraction has 8791 states and 13671 transitions. [2019-09-08 12:19:26,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 8791 states and 13671 transitions. [2019-09-08 12:19:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:26,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:26,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:26,337 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:26,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash 457459003, now seen corresponding path program 1 times [2019-09-08 12:19:26,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:26,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:26,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:26,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:26,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:26,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 12:19:26,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:26,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:19:26,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:19:26,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:19:26,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:26,555 INFO L87 Difference]: Start difference. First operand 8791 states and 13671 transitions. Second operand 5 states. [2019-09-08 12:19:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:27,671 INFO L93 Difference]: Finished difference Result 26258 states and 40884 transitions. [2019-09-08 12:19:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:27,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 12:19:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:27,728 INFO L225 Difference]: With dead ends: 26258 [2019-09-08 12:19:27,728 INFO L226 Difference]: Without dead ends: 17524 [2019-09-08 12:19:27,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17524 states. [2019-09-08 12:19:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17524 to 17522. [2019-09-08 12:19:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17522 states. [2019-09-08 12:19:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17522 states to 17522 states and 27143 transitions. [2019-09-08 12:19:28,663 INFO L78 Accepts]: Start accepts. Automaton has 17522 states and 27143 transitions. Word has length 144 [2019-09-08 12:19:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:28,663 INFO L475 AbstractCegarLoop]: Abstraction has 17522 states and 27143 transitions. [2019-09-08 12:19:28,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:19:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17522 states and 27143 transitions. [2019-09-08 12:19:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:28,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:28,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:28,710 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:28,710 INFO L82 PathProgramCache]: Analyzing trace with hash -633266858, now seen corresponding path program 1 times [2019-09-08 12:19:28,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:28,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:28,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:28,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:19:28,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:19:28,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:19:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:28,830 INFO L87 Difference]: Start difference. First operand 17522 states and 27143 transitions. Second operand 5 states. [2019-09-08 12:19:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:29,552 INFO L93 Difference]: Finished difference Result 25000 states and 38740 transitions. [2019-09-08 12:19:29,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:29,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 12:19:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:29,578 INFO L225 Difference]: With dead ends: 25000 [2019-09-08 12:19:29,578 INFO L226 Difference]: Without dead ends: 8830 [2019-09-08 12:19:29,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2019-09-08 12:19:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 8830. [2019-09-08 12:19:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8830 states. [2019-09-08 12:19:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8830 states to 8830 states and 13643 transitions. [2019-09-08 12:19:29,973 INFO L78 Accepts]: Start accepts. Automaton has 8830 states and 13643 transitions. Word has length 144 [2019-09-08 12:19:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:29,974 INFO L475 AbstractCegarLoop]: Abstraction has 8830 states and 13643 transitions. [2019-09-08 12:19:29,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:19:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8830 states and 13643 transitions. [2019-09-08 12:19:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:29,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:29,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:29,998 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:29,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:29,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1477886134, now seen corresponding path program 1 times [2019-09-08 12:19:29,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:29,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:30,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:30,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:30,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:30,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:30,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:19:30,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:19:30,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:19:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:30,159 INFO L87 Difference]: Start difference. First operand 8830 states and 13643 transitions. Second operand 5 states. [2019-09-08 12:19:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:31,203 INFO L93 Difference]: Finished difference Result 17568 states and 27178 transitions. [2019-09-08 12:19:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:31,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 12:19:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:31,223 INFO L225 Difference]: With dead ends: 17568 [2019-09-08 12:19:31,224 INFO L226 Difference]: Without dead ends: 8830 [2019-09-08 12:19:31,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2019-09-08 12:19:31,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 8830. [2019-09-08 12:19:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8830 states. [2019-09-08 12:19:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8830 states to 8830 states and 13561 transitions. [2019-09-08 12:19:31,648 INFO L78 Accepts]: Start accepts. Automaton has 8830 states and 13561 transitions. Word has length 144 [2019-09-08 12:19:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:31,649 INFO L475 AbstractCegarLoop]: Abstraction has 8830 states and 13561 transitions. [2019-09-08 12:19:31,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:19:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8830 states and 13561 transitions. [2019-09-08 12:19:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:31,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:31,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:31,667 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash -487303850, now seen corresponding path program 1 times [2019-09-08 12:19:31,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:31,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:31,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:31,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:31,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:31,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:19:31,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:19:31,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:19:31,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:19:31,785 INFO L87 Difference]: Start difference. First operand 8830 states and 13561 transitions. Second operand 5 states. [2019-09-08 12:19:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:32,430 INFO L93 Difference]: Finished difference Result 17532 states and 26968 transitions. [2019-09-08 12:19:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:19:32,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 12:19:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:32,452 INFO L225 Difference]: With dead ends: 17532 [2019-09-08 12:19:32,452 INFO L226 Difference]: Without dead ends: 8830 [2019-09-08 12:19:32,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:19:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2019-09-08 12:19:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 8830. [2019-09-08 12:19:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8830 states. [2019-09-08 12:19:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8830 states to 8830 states and 13429 transitions. [2019-09-08 12:19:32,917 INFO L78 Accepts]: Start accepts. Automaton has 8830 states and 13429 transitions. Word has length 144 [2019-09-08 12:19:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:32,918 INFO L475 AbstractCegarLoop]: Abstraction has 8830 states and 13429 transitions. [2019-09-08 12:19:32,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:19:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8830 states and 13429 transitions. [2019-09-08 12:19:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:32,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:32,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:32,933 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:32,933 INFO L82 PathProgramCache]: Analyzing trace with hash 357859424, now seen corresponding path program 1 times [2019-09-08 12:19:32,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:32,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:32,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:32,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:32,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:33,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:33,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:33,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:33,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:33,055 INFO L87 Difference]: Start difference. First operand 8830 states and 13429 transitions. Second operand 3 states. [2019-09-08 12:19:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:33,651 INFO L93 Difference]: Finished difference Result 15202 states and 23063 transitions. [2019-09-08 12:19:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:33,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:19:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:33,670 INFO L225 Difference]: With dead ends: 15202 [2019-09-08 12:19:33,671 INFO L226 Difference]: Without dead ends: 7712 [2019-09-08 12:19:33,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states. [2019-09-08 12:19:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 7710. [2019-09-08 12:19:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7710 states. [2019-09-08 12:19:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7710 states to 7710 states and 11613 transitions. [2019-09-08 12:19:34,041 INFO L78 Accepts]: Start accepts. Automaton has 7710 states and 11613 transitions. Word has length 144 [2019-09-08 12:19:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:34,042 INFO L475 AbstractCegarLoop]: Abstraction has 7710 states and 11613 transitions. [2019-09-08 12:19:34,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7710 states and 11613 transitions. [2019-09-08 12:19:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:19:34,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:34,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:34,048 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:34,049 INFO L82 PathProgramCache]: Analyzing trace with hash -35682098, now seen corresponding path program 1 times [2019-09-08 12:19:34,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:34,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:34,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:34,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:34,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:34,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:34,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:34,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:34,245 INFO L87 Difference]: Start difference. First operand 7710 states and 11613 transitions. Second operand 8 states. [2019-09-08 12:19:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:37,556 INFO L93 Difference]: Finished difference Result 77045 states and 116062 transitions. [2019-09-08 12:19:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:19:37,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2019-09-08 12:19:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:37,707 INFO L225 Difference]: With dead ends: 77045 [2019-09-08 12:19:37,707 INFO L226 Difference]: Without dead ends: 69495 [2019-09-08 12:19:37,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:19:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69495 states. [2019-09-08 12:19:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69495 to 22583. [2019-09-08 12:19:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22583 states. [2019-09-08 12:19:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22583 states to 22583 states and 33680 transitions. [2019-09-08 12:19:40,215 INFO L78 Accepts]: Start accepts. Automaton has 22583 states and 33680 transitions. Word has length 144 [2019-09-08 12:19:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:40,216 INFO L475 AbstractCegarLoop]: Abstraction has 22583 states and 33680 transitions. [2019-09-08 12:19:40,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 22583 states and 33680 transitions. [2019-09-08 12:19:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:19:40,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:40,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:40,228 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash -181181800, now seen corresponding path program 1 times [2019-09-08 12:19:40,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:40,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:40,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:40,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:40,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:40,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:40,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:40,321 INFO L87 Difference]: Start difference. First operand 22583 states and 33680 transitions. Second operand 3 states. [2019-09-08 12:19:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:41,990 INFO L93 Difference]: Finished difference Result 61794 states and 91975 transitions. [2019-09-08 12:19:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:41,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-08 12:19:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:42,045 INFO L225 Difference]: With dead ends: 61794 [2019-09-08 12:19:42,046 INFO L226 Difference]: Without dead ends: 39264 [2019-09-08 12:19:42,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39264 states. [2019-09-08 12:19:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39264 to 39262. [2019-09-08 12:19:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39262 states. [2019-09-08 12:19:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39262 states to 39262 states and 57964 transitions. [2019-09-08 12:19:44,201 INFO L78 Accepts]: Start accepts. Automaton has 39262 states and 57964 transitions. Word has length 147 [2019-09-08 12:19:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:44,201 INFO L475 AbstractCegarLoop]: Abstraction has 39262 states and 57964 transitions. [2019-09-08 12:19:44,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39262 states and 57964 transitions. [2019-09-08 12:19:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:19:44,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:44,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:44,226 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash 572183116, now seen corresponding path program 1 times [2019-09-08 12:19:44,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:44,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:44,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:45,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:45,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:45,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:45,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:45,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:45,138 INFO L87 Difference]: Start difference. First operand 39262 states and 57964 transitions. Second operand 3 states. [2019-09-08 12:19:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:46,192 INFO L93 Difference]: Finished difference Result 56450 states and 83246 transitions. [2019-09-08 12:19:46,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:46,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-08 12:19:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:46,221 INFO L225 Difference]: With dead ends: 56450 [2019-09-08 12:19:46,221 INFO L226 Difference]: Without dead ends: 20489 [2019-09-08 12:19:46,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20489 states. [2019-09-08 12:19:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20489 to 20487. [2019-09-08 12:19:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2019-09-08 12:19:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 30071 transitions. [2019-09-08 12:19:47,579 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 30071 transitions. Word has length 148 [2019-09-08 12:19:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:47,579 INFO L475 AbstractCegarLoop]: Abstraction has 20487 states and 30071 transitions. [2019-09-08 12:19:47,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 30071 transitions. [2019-09-08 12:19:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 12:19:47,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:47,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:47,594 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash -418639672, now seen corresponding path program 1 times [2019-09-08 12:19:47,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:47,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:47,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:47,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:47,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:19:47,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:19:47,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:19:47,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:47,685 INFO L87 Difference]: Start difference. First operand 20487 states and 30071 transitions. Second operand 3 states. [2019-09-08 12:19:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:48,586 INFO L93 Difference]: Finished difference Result 40873 states and 60028 transitions. [2019-09-08 12:19:48,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:19:48,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 12:19:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:48,614 INFO L225 Difference]: With dead ends: 40873 [2019-09-08 12:19:48,614 INFO L226 Difference]: Without dead ends: 20485 [2019-09-08 12:19:48,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:19:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20485 states. [2019-09-08 12:19:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20485 to 20485. [2019-09-08 12:19:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20485 states. [2019-09-08 12:19:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 30063 transitions. [2019-09-08 12:19:49,815 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 30063 transitions. Word has length 149 [2019-09-08 12:19:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:49,816 INFO L475 AbstractCegarLoop]: Abstraction has 20485 states and 30063 transitions. [2019-09-08 12:19:49,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:19:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 30063 transitions. [2019-09-08 12:19:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 12:19:49,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:49,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:49,829 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1661340980, now seen corresponding path program 1 times [2019-09-08 12:19:49,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:49,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:49,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:50,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:50,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:50,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:50,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:50,198 INFO L87 Difference]: Start difference. First operand 20485 states and 30063 transitions. Second operand 8 states. [2019-09-08 12:19:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:52,384 INFO L93 Difference]: Finished difference Result 53588 states and 78547 transitions. [2019-09-08 12:19:52,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:19:52,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 149 [2019-09-08 12:19:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:52,415 INFO L225 Difference]: With dead ends: 53588 [2019-09-08 12:19:52,415 INFO L226 Difference]: Without dead ends: 33204 [2019-09-08 12:19:52,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:19:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33204 states. [2019-09-08 12:19:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33204 to 26453. [2019-09-08 12:19:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26453 states. [2019-09-08 12:19:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26453 states to 26453 states and 38361 transitions. [2019-09-08 12:19:53,869 INFO L78 Accepts]: Start accepts. Automaton has 26453 states and 38361 transitions. Word has length 149 [2019-09-08 12:19:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:53,869 INFO L475 AbstractCegarLoop]: Abstraction has 26453 states and 38361 transitions. [2019-09-08 12:19:53,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:19:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26453 states and 38361 transitions. [2019-09-08 12:19:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:19:53,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:53,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:53,884 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1966780748, now seen corresponding path program 1 times [2019-09-08 12:19:53,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:53,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:53,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:54,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:54,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:54,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:19:54,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:19:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:19:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:19:54,064 INFO L87 Difference]: Start difference. First operand 26453 states and 38361 transitions. Second operand 8 states. [2019-09-08 12:19:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:59,854 INFO L93 Difference]: Finished difference Result 98739 states and 144332 transitions. [2019-09-08 12:19:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:19:59,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 12:19:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:59,950 INFO L225 Difference]: With dead ends: 98739 [2019-09-08 12:19:59,950 INFO L226 Difference]: Without dead ends: 92881 [2019-09-08 12:19:59,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:20:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92881 states. [2019-09-08 12:20:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92881 to 33200. [2019-09-08 12:20:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33200 states. [2019-09-08 12:20:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33200 states to 33200 states and 48208 transitions. [2019-09-08 12:20:02,290 INFO L78 Accepts]: Start accepts. Automaton has 33200 states and 48208 transitions. Word has length 150 [2019-09-08 12:20:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:02,290 INFO L475 AbstractCegarLoop]: Abstraction has 33200 states and 48208 transitions. [2019-09-08 12:20:02,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 33200 states and 48208 transitions. [2019-09-08 12:20:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:20:02,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:02,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:02,309 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1982869934, now seen corresponding path program 1 times [2019-09-08 12:20:02,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:02,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:02,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:02,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:02,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:20:02,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:20:02,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:20:02,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:20:02,526 INFO L87 Difference]: Start difference. First operand 33200 states and 48208 transitions. Second operand 8 states. [2019-09-08 12:20:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:08,096 INFO L93 Difference]: Finished difference Result 92121 states and 134086 transitions. [2019-09-08 12:20:08,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:08,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 12:20:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:08,173 INFO L225 Difference]: With dead ends: 92121 [2019-09-08 12:20:08,173 INFO L226 Difference]: Without dead ends: 74871 [2019-09-08 12:20:08,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:20:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74871 states. [2019-09-08 12:20:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74871 to 45162. [2019-09-08 12:20:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45162 states. [2019-09-08 12:20:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45162 states to 45162 states and 65442 transitions. [2019-09-08 12:20:11,326 INFO L78 Accepts]: Start accepts. Automaton has 45162 states and 65442 transitions. Word has length 150 [2019-09-08 12:20:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:11,327 INFO L475 AbstractCegarLoop]: Abstraction has 45162 states and 65442 transitions. [2019-09-08 12:20:11,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 45162 states and 65442 transitions. [2019-09-08 12:20:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:20:11,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:11,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:11,347 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1240478424, now seen corresponding path program 1 times [2019-09-08 12:20:11,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:11,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:11,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:11,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:11,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:20:11,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:20:11,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:20:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:20:11,429 INFO L87 Difference]: Start difference. First operand 45162 states and 65442 transitions. Second operand 3 states. [2019-09-08 12:20:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:13,325 INFO L93 Difference]: Finished difference Result 65214 states and 94436 transitions. [2019-09-08 12:20:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:20:13,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 12:20:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:13,350 INFO L225 Difference]: With dead ends: 65214 [2019-09-08 12:20:13,350 INFO L226 Difference]: Without dead ends: 23037 [2019-09-08 12:20:13,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:20:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23037 states. [2019-09-08 12:20:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23037 to 23035. [2019-09-08 12:20:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23035 states. [2019-09-08 12:20:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23035 states to 23035 states and 33147 transitions. [2019-09-08 12:20:14,863 INFO L78 Accepts]: Start accepts. Automaton has 23035 states and 33147 transitions. Word has length 150 [2019-09-08 12:20:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:14,863 INFO L475 AbstractCegarLoop]: Abstraction has 23035 states and 33147 transitions. [2019-09-08 12:20:14,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:20:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 23035 states and 33147 transitions. [2019-09-08 12:20:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:20:14,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:14,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:14,874 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1230890516, now seen corresponding path program 1 times [2019-09-08 12:20:14,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:14,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:14,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:20:14,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:20:14,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:20:14,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:20:14,982 INFO L87 Difference]: Start difference. First operand 23035 states and 33147 transitions. Second operand 5 states. [2019-09-08 12:20:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:17,613 INFO L93 Difference]: Finished difference Result 46545 states and 67234 transitions. [2019-09-08 12:20:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:20:17,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 12:20:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:17,656 INFO L225 Difference]: With dead ends: 46545 [2019-09-08 12:20:17,656 INFO L226 Difference]: Without dead ends: 37919 [2019-09-08 12:20:17,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:20:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37919 states. [2019-09-08 12:20:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37919 to 34987. [2019-09-08 12:20:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34987 states. [2019-09-08 12:20:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34987 states to 34987 states and 50463 transitions. [2019-09-08 12:20:20,839 INFO L78 Accepts]: Start accepts. Automaton has 34987 states and 50463 transitions. Word has length 150 [2019-09-08 12:20:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:20,840 INFO L475 AbstractCegarLoop]: Abstraction has 34987 states and 50463 transitions. [2019-09-08 12:20:20,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:20:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 34987 states and 50463 transitions. [2019-09-08 12:20:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:20:20,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:20,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:20,855 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash -736590432, now seen corresponding path program 1 times [2019-09-08 12:20:20,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:20,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:20,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:20,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:20,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:20:20,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:20:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:20:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:20:20,969 INFO L87 Difference]: Start difference. First operand 34987 states and 50463 transitions. Second operand 5 states. [2019-09-08 12:20:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:24,579 INFO L93 Difference]: Finished difference Result 66737 states and 96466 transitions. [2019-09-08 12:20:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:20:24,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 12:20:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:24,628 INFO L225 Difference]: With dead ends: 66737 [2019-09-08 12:20:24,628 INFO L226 Difference]: Without dead ends: 49519 [2019-09-08 12:20:24,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:20:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49519 states. [2019-09-08 12:20:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49519 to 43723. [2019-09-08 12:20:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43723 states. [2019-09-08 12:20:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43723 states to 43723 states and 63055 transitions. [2019-09-08 12:20:27,883 INFO L78 Accepts]: Start accepts. Automaton has 43723 states and 63055 transitions. Word has length 150 [2019-09-08 12:20:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:27,883 INFO L475 AbstractCegarLoop]: Abstraction has 43723 states and 63055 transitions. [2019-09-08 12:20:27,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:20:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 43723 states and 63055 transitions. [2019-09-08 12:20:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:20:27,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:27,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:27,904 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -621309414, now seen corresponding path program 1 times [2019-09-08 12:20:27,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:27,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:27,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:28,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:28,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:20:28,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:20:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:20:28,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:20:28,018 INFO L87 Difference]: Start difference. First operand 43723 states and 63055 transitions. Second operand 5 states. [2019-09-08 12:20:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:33,022 INFO L93 Difference]: Finished difference Result 81497 states and 117742 transitions. [2019-09-08 12:20:33,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:20:33,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 12:20:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:33,083 INFO L225 Difference]: With dead ends: 81497 [2019-09-08 12:20:33,083 INFO L226 Difference]: Without dead ends: 55655 [2019-09-08 12:20:33,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:20:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55655 states. [2019-09-08 12:20:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55655 to 49811. [2019-09-08 12:20:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49811 states. [2019-09-08 12:20:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49811 states to 49811 states and 71839 transitions. [2019-09-08 12:20:36,889 INFO L78 Accepts]: Start accepts. Automaton has 49811 states and 71839 transitions. Word has length 150 [2019-09-08 12:20:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:36,889 INFO L475 AbstractCegarLoop]: Abstraction has 49811 states and 71839 transitions. [2019-09-08 12:20:36,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:20:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 49811 states and 71839 transitions. [2019-09-08 12:20:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:20:36,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:36,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:36,906 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1244623102, now seen corresponding path program 1 times [2019-09-08 12:20:36,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:36,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:37,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:37,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:20:37,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:20:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:20:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:20:37,059 INFO L87 Difference]: Start difference. First operand 49811 states and 71839 transitions. Second operand 8 states. [2019-09-08 12:20:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:49,200 INFO L93 Difference]: Finished difference Result 165937 states and 239992 transitions. [2019-09-08 12:20:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:20:49,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 12:20:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:49,357 INFO L225 Difference]: With dead ends: 165937 [2019-09-08 12:20:49,357 INFO L226 Difference]: Without dead ends: 148719 [2019-09-08 12:20:49,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:20:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148719 states. [2019-09-08 12:20:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148719 to 55921. [2019-09-08 12:20:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55921 states. [2019-09-08 12:20:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55921 states to 55921 states and 80669 transitions. [2019-09-08 12:20:54,542 INFO L78 Accepts]: Start accepts. Automaton has 55921 states and 80669 transitions. Word has length 150 [2019-09-08 12:20:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:54,542 INFO L475 AbstractCegarLoop]: Abstraction has 55921 states and 80669 transitions. [2019-09-08 12:20:54,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:20:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 55921 states and 80669 transitions. [2019-09-08 12:20:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:20:54,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:54,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:54,561 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -25005510, now seen corresponding path program 1 times [2019-09-08 12:20:54,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:54,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:54,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:54,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:20:54,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:20:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:20:54,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:20:54,832 INFO L87 Difference]: Start difference. First operand 55921 states and 80669 transitions. Second operand 10 states. [2019-09-08 12:21:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:25,259 INFO L93 Difference]: Finished difference Result 379871 states and 545839 transitions. [2019-09-08 12:21:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:21:25,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-08 12:21:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:25,697 INFO L225 Difference]: With dead ends: 379871 [2019-09-08 12:21:25,698 INFO L226 Difference]: Without dead ends: 326413 [2019-09-08 12:21:25,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:21:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326413 states. [2019-09-08 12:21:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326413 to 55945. [2019-09-08 12:21:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55945 states. [2019-09-08 12:21:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55945 states to 55945 states and 80693 transitions. [2019-09-08 12:21:33,866 INFO L78 Accepts]: Start accepts. Automaton has 55945 states and 80693 transitions. Word has length 152 [2019-09-08 12:21:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:33,866 INFO L475 AbstractCegarLoop]: Abstraction has 55945 states and 80693 transitions. [2019-09-08 12:21:33,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:21:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55945 states and 80693 transitions. [2019-09-08 12:21:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:21:33,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:33,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:33,885 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2118858450, now seen corresponding path program 1 times [2019-09-08 12:21:33,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:33,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:33,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:34,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:34,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:21:34,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:21:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:21:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:21:34,111 INFO L87 Difference]: Start difference. First operand 55945 states and 80693 transitions. Second operand 10 states. [2019-09-08 12:22:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:26,119 INFO L93 Difference]: Finished difference Result 488332 states and 701815 transitions. [2019-09-08 12:22:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:22:26,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-08 12:22:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:26,624 INFO L225 Difference]: With dead ends: 488332 [2019-09-08 12:22:26,624 INFO L226 Difference]: Without dead ends: 434970 [2019-09-08 12:22:26,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:22:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434970 states. [2019-09-08 12:22:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434970 to 56112. [2019-09-08 12:22:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56112 states. [2019-09-08 12:22:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56112 states to 56112 states and 80903 transitions. [2019-09-08 12:22:36,455 INFO L78 Accepts]: Start accepts. Automaton has 56112 states and 80903 transitions. Word has length 152 [2019-09-08 12:22:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:36,455 INFO L475 AbstractCegarLoop]: Abstraction has 56112 states and 80903 transitions. [2019-09-08 12:22:36,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:22:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 56112 states and 80903 transitions. [2019-09-08 12:22:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:22:36,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:36,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:36,476 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:36,476 INFO L82 PathProgramCache]: Analyzing trace with hash -170540571, now seen corresponding path program 1 times [2019-09-08 12:22:36,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:36,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:36,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:36,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:36,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:36,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:36,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:22:36,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:22:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:22:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:22:36,540 INFO L87 Difference]: Start difference. First operand 56112 states and 80903 transitions. Second operand 3 states. [2019-09-08 12:22:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:51,836 INFO L93 Difference]: Finished difference Result 164942 states and 237479 transitions. [2019-09-08 12:22:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:22:51,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 12:22:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:51,957 INFO L225 Difference]: With dead ends: 164942 [2019-09-08 12:22:51,957 INFO L226 Difference]: Without dead ends: 111568 [2019-09-08 12:22:51,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:22:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111568 states. [2019-09-08 12:23:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111568 to 111566. [2019-09-08 12:23:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111566 states. [2019-09-08 12:23:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111566 states to 111566 states and 159967 transitions. [2019-09-08 12:23:06,242 INFO L78 Accepts]: Start accepts. Automaton has 111566 states and 159967 transitions. Word has length 152 [2019-09-08 12:23:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:06,242 INFO L475 AbstractCegarLoop]: Abstraction has 111566 states and 159967 transitions. [2019-09-08 12:23:06,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:23:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 111566 states and 159967 transitions. [2019-09-08 12:23:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:23:06,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:06,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:06,280 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash -784563424, now seen corresponding path program 1 times [2019-09-08 12:23:06,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:06,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:06,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:06,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:06,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:06,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:06,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:23:06,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:23:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:23:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:23:06,353 INFO L87 Difference]: Start difference. First operand 111566 states and 159967 transitions. Second operand 3 states. [2019-09-08 12:23:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:16,361 INFO L93 Difference]: Finished difference Result 162834 states and 233345 transitions. [2019-09-08 12:23:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:23:16,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 12:23:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:16,420 INFO L225 Difference]: With dead ends: 162834 [2019-09-08 12:23:16,420 INFO L226 Difference]: Without dead ends: 56628 [2019-09-08 12:23:16,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:23:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56628 states. [2019-09-08 12:23:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56628 to 56626. [2019-09-08 12:23:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56626 states. [2019-09-08 12:23:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56626 states to 56626 states and 80543 transitions. [2019-09-08 12:23:23,744 INFO L78 Accepts]: Start accepts. Automaton has 56626 states and 80543 transitions. Word has length 152 [2019-09-08 12:23:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:23,745 INFO L475 AbstractCegarLoop]: Abstraction has 56626 states and 80543 transitions. [2019-09-08 12:23:23,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:23:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 56626 states and 80543 transitions. [2019-09-08 12:23:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 12:23:23,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:23,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:23,768 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1773541836, now seen corresponding path program 1 times [2019-09-08 12:23:23,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:23,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:23,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:23,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:23,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:23:23,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:23:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:23:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:23:23,985 INFO L87 Difference]: Start difference. First operand 56626 states and 80543 transitions. Second operand 10 states. [2019-09-08 12:24:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:11,473 INFO L93 Difference]: Finished difference Result 387020 states and 548605 transitions. [2019-09-08 12:24:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:24:11,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-08 12:24:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:11,871 INFO L225 Difference]: With dead ends: 387020 [2019-09-08 12:24:11,871 INFO L226 Difference]: Without dead ends: 332130 [2019-09-08 12:24:11,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:24:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332130 states. [2019-09-08 12:24:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332130 to 57050. [2019-09-08 12:24:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57050 states. [2019-09-08 12:24:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57050 states to 57050 states and 81016 transitions. [2019-09-08 12:24:22,200 INFO L78 Accepts]: Start accepts. Automaton has 57050 states and 81016 transitions. Word has length 152 [2019-09-08 12:24:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:22,201 INFO L475 AbstractCegarLoop]: Abstraction has 57050 states and 81016 transitions. [2019-09-08 12:24:22,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:24:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 57050 states and 81016 transitions. [2019-09-08 12:24:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:24:22,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:22,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:22,221 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1522779547, now seen corresponding path program 1 times [2019-09-08 12:24:22,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:22,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:22,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:22,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:22,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:22,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:22,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:22,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:22,272 INFO L87 Difference]: Start difference. First operand 57050 states and 81016 transitions. Second operand 3 states. [2019-09-08 12:24:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:30,398 INFO L93 Difference]: Finished difference Result 112384 states and 160121 transitions. [2019-09-08 12:24:30,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:30,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 12:24:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:30,452 INFO L225 Difference]: With dead ends: 112384 [2019-09-08 12:24:30,452 INFO L226 Difference]: Without dead ends: 55934 [2019-09-08 12:24:30,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55934 states. [2019-09-08 12:24:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55934 to 55934. [2019-09-08 12:24:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55934 states. [2019-09-08 12:24:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55934 states to 55934 states and 79214 transitions. [2019-09-08 12:24:40,546 INFO L78 Accepts]: Start accepts. Automaton has 55934 states and 79214 transitions. Word has length 153 [2019-09-08 12:24:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:40,547 INFO L475 AbstractCegarLoop]: Abstraction has 55934 states and 79214 transitions. [2019-09-08 12:24:40,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 55934 states and 79214 transitions. [2019-09-08 12:24:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:24:40,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:40,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:40,566 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash 452628205, now seen corresponding path program 1 times [2019-09-08 12:24:40,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:40,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:40,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:40,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:40,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:40,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:24:40,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:24:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:24:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:24:40,793 INFO L87 Difference]: Start difference. First operand 55934 states and 79214 transitions. Second operand 10 states. [2019-09-08 12:25:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:57,870 INFO L93 Difference]: Finished difference Result 522224 states and 735120 transitions. [2019-09-08 12:25:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:25:57,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-08 12:25:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:58,484 INFO L225 Difference]: With dead ends: 522224 [2019-09-08 12:25:58,484 INFO L226 Difference]: Without dead ends: 467958 [2019-09-08 12:25:58,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:25:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467958 states. [2019-09-08 12:26:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467958 to 55562. [2019-09-08 12:26:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55562 states. [2019-09-08 12:26:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55562 states to 55562 states and 78638 transitions. [2019-09-08 12:26:10,621 INFO L78 Accepts]: Start accepts. Automaton has 55562 states and 78638 transitions. Word has length 153 [2019-09-08 12:26:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:10,621 INFO L475 AbstractCegarLoop]: Abstraction has 55562 states and 78638 transitions. [2019-09-08 12:26:10,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:26:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55562 states and 78638 transitions. [2019-09-08 12:26:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:26:10,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:10,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:10,644 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:10,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1603415415, now seen corresponding path program 1 times [2019-09-08 12:26:10,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:10,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:10,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:10,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:10,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:10,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:26:10,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:26:10,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:26:10,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:26:10,723 INFO L87 Difference]: Start difference. First operand 55562 states and 78638 transitions. Second operand 3 states. [2019-09-08 12:26:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:15,621 INFO L93 Difference]: Finished difference Result 80910 states and 114464 transitions. [2019-09-08 12:26:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:26:15,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 12:26:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:15,651 INFO L225 Difference]: With dead ends: 80910 [2019-09-08 12:26:15,651 INFO L226 Difference]: Without dead ends: 28398 [2019-09-08 12:26:15,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:26:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28398 states. [2019-09-08 12:26:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28398 to 28396. [2019-09-08 12:26:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28396 states. [2019-09-08 12:26:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28396 states to 28396 states and 39804 transitions. [2019-09-08 12:26:20,618 INFO L78 Accepts]: Start accepts. Automaton has 28396 states and 39804 transitions. Word has length 153 [2019-09-08 12:26:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:20,619 INFO L475 AbstractCegarLoop]: Abstraction has 28396 states and 39804 transitions. [2019-09-08 12:26:20,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:26:20,619 INFO L276 IsEmpty]: Start isEmpty. Operand 28396 states and 39804 transitions. [2019-09-08 12:26:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:26:20,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:20,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:20,628 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1644184107, now seen corresponding path program 1 times [2019-09-08 12:26:20,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:20,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:20,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:20,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:20,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:26:20,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:26:20,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:26:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:26:20,864 INFO L87 Difference]: Start difference. First operand 28396 states and 39804 transitions. Second operand 10 states. [2019-09-08 12:26:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:51,573 INFO L93 Difference]: Finished difference Result 192872 states and 270220 transitions. [2019-09-08 12:26:51,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:26:51,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-08 12:26:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:51,757 INFO L225 Difference]: With dead ends: 192872 [2019-09-08 12:26:51,757 INFO L226 Difference]: Without dead ends: 165974 [2019-09-08 12:26:51,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:26:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165974 states. [2019-09-08 12:27:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165974 to 29420. [2019-09-08 12:27:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29420 states. [2019-09-08 12:27:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29420 states to 29420 states and 41042 transitions. [2019-09-08 12:27:01,363 INFO L78 Accepts]: Start accepts. Automaton has 29420 states and 41042 transitions. Word has length 154 [2019-09-08 12:27:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:01,363 INFO L475 AbstractCegarLoop]: Abstraction has 29420 states and 41042 transitions. [2019-09-08 12:27:01,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:27:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 29420 states and 41042 transitions. [2019-09-08 12:27:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:27:01,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:01,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:01,373 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash 713901048, now seen corresponding path program 1 times [2019-09-08 12:27:01,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:01,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:01,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:27:01,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:27:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:27:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:27:01,430 INFO L87 Difference]: Start difference. First operand 29420 states and 41042 transitions. Second operand 3 states. [2019-09-08 12:27:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:06,755 INFO L93 Difference]: Finished difference Result 56406 states and 79171 transitions. [2019-09-08 12:27:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:27:06,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 12:27:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:06,780 INFO L225 Difference]: With dead ends: 56406 [2019-09-08 12:27:06,780 INFO L226 Difference]: Without dead ends: 28104 [2019-09-08 12:27:06,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:27:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28104 states. [2019-09-08 12:27:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28104 to 28104. [2019-09-08 12:27:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28104 states. [2019-09-08 12:27:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28104 states to 28104 states and 39176 transitions. [2019-09-08 12:27:11,993 INFO L78 Accepts]: Start accepts. Automaton has 28104 states and 39176 transitions. Word has length 155 [2019-09-08 12:27:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:11,993 INFO L475 AbstractCegarLoop]: Abstraction has 28104 states and 39176 transitions. [2019-09-08 12:27:11,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:27:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 28104 states and 39176 transitions. [2019-09-08 12:27:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:27:12,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:12,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:12,001 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1986766144, now seen corresponding path program 1 times [2019-09-08 12:27:12,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:12,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:12,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:12,304 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 18 [2019-09-08 12:27:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:12,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:12,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:27:12,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:27:12,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:27:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:27:12,378 INFO L87 Difference]: Start difference. First operand 28104 states and 39176 transitions. Second operand 10 states. [2019-09-08 12:28:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:00,515 INFO L93 Difference]: Finished difference Result 257540 states and 355823 transitions. [2019-09-08 12:28:00,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:28:00,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-08 12:28:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:00,777 INFO L225 Difference]: With dead ends: 257540 [2019-09-08 12:28:00,777 INFO L226 Difference]: Without dead ends: 230700 [2019-09-08 12:28:00,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:28:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230700 states. [2019-09-08 12:28:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230700 to 28156. [2019-09-08 12:28:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28156 states. [2019-09-08 12:28:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28156 states to 28156 states and 39202 transitions. [2019-09-08 12:28:07,876 INFO L78 Accepts]: Start accepts. Automaton has 28156 states and 39202 transitions. Word has length 155 [2019-09-08 12:28:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:07,876 INFO L475 AbstractCegarLoop]: Abstraction has 28156 states and 39202 transitions. [2019-09-08 12:28:07,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:28:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28156 states and 39202 transitions. [2019-09-08 12:28:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:28:07,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:07,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:07,884 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1550421164, now seen corresponding path program 1 times [2019-09-08 12:28:07,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:07,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:07,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:07,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:07,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:07,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:07,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:07,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:07,964 INFO L87 Difference]: Start difference. First operand 28156 states and 39202 transitions. Second operand 3 states. [2019-09-08 12:28:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:11,181 INFO L93 Difference]: Finished difference Result 40688 states and 56684 transitions. [2019-09-08 12:28:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:11,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 12:28:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:11,197 INFO L225 Difference]: With dead ends: 40688 [2019-09-08 12:28:11,197 INFO L226 Difference]: Without dead ends: 14902 [2019-09-08 12:28:11,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14902 states. [2019-09-08 12:28:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14902 to 14900. [2019-09-08 12:28:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14900 states. [2019-09-08 12:28:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14900 states to 14900 states and 20450 transitions. [2019-09-08 12:28:14,388 INFO L78 Accepts]: Start accepts. Automaton has 14900 states and 20450 transitions. Word has length 155 [2019-09-08 12:28:14,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:14,388 INFO L475 AbstractCegarLoop]: Abstraction has 14900 states and 20450 transitions. [2019-09-08 12:28:14,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 14900 states and 20450 transitions. [2019-09-08 12:28:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 12:28:14,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:14,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:14,394 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:14,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1616574444, now seen corresponding path program 1 times [2019-09-08 12:28:14,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:14,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:14,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:14,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:28:14,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:28:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:28:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:28:14,502 INFO L87 Difference]: Start difference. First operand 14900 states and 20450 transitions. Second operand 4 states. [2019-09-08 12:28:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:17,666 INFO L93 Difference]: Finished difference Result 27614 states and 37971 transitions. [2019-09-08 12:28:17,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:28:17,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-08 12:28:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:17,681 INFO L225 Difference]: With dead ends: 27614 [2019-09-08 12:28:17,681 INFO L226 Difference]: Without dead ends: 14880 [2019-09-08 12:28:17,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14880 states. [2019-09-08 12:28:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14880 to 14860. [2019-09-08 12:28:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-09-08 12:28:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 20250 transitions. [2019-09-08 12:28:20,791 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 20250 transitions. Word has length 156 [2019-09-08 12:28:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:20,791 INFO L475 AbstractCegarLoop]: Abstraction has 14860 states and 20250 transitions. [2019-09-08 12:28:20,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:28:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 20250 transitions. [2019-09-08 12:28:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:28:20,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:20,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:20,798 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1262761436, now seen corresponding path program 1 times [2019-09-08 12:28:20,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:20,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:20,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:20,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:20,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:20,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:20,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:20,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:20,851 INFO L87 Difference]: Start difference. First operand 14860 states and 20250 transitions. Second operand 3 states. [2019-09-08 12:28:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:25,592 INFO L93 Difference]: Finished difference Result 34008 states and 45564 transitions. [2019-09-08 12:28:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:25,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 12:28:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:25,611 INFO L225 Difference]: With dead ends: 34008 [2019-09-08 12:28:25,611 INFO L226 Difference]: Without dead ends: 21350 [2019-09-08 12:28:25,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21350 states. [2019-09-08 12:28:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21350 to 20484. [2019-09-08 12:28:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-09-08 12:28:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 26454 transitions. [2019-09-08 12:28:30,161 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 26454 transitions. Word has length 158 [2019-09-08 12:28:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:30,161 INFO L475 AbstractCegarLoop]: Abstraction has 20484 states and 26454 transitions. [2019-09-08 12:28:30,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 26454 transitions. [2019-09-08 12:28:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:28:30,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:30,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:30,168 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash -600875830, now seen corresponding path program 1 times [2019-09-08 12:28:30,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:30,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:30,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:30,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:30,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:30,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:30,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:30,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:30,245 INFO L87 Difference]: Start difference. First operand 20484 states and 26454 transitions. Second operand 3 states. [2019-09-08 12:28:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:35,333 INFO L93 Difference]: Finished difference Result 33880 states and 44080 transitions. [2019-09-08 12:28:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:35,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 12:28:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:35,352 INFO L225 Difference]: With dead ends: 33880 [2019-09-08 12:28:35,352 INFO L226 Difference]: Without dead ends: 22830 [2019-09-08 12:28:35,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22830 states. [2019-09-08 12:28:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22830 to 20732. [2019-09-08 12:28:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20732 states. [2019-09-08 12:28:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20732 states to 20732 states and 26758 transitions. [2019-09-08 12:28:40,105 INFO L78 Accepts]: Start accepts. Automaton has 20732 states and 26758 transitions. Word has length 159 [2019-09-08 12:28:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:40,105 INFO L475 AbstractCegarLoop]: Abstraction has 20732 states and 26758 transitions. [2019-09-08 12:28:40,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20732 states and 26758 transitions. [2019-09-08 12:28:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:28:40,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:40,112 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:40,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1348657046, now seen corresponding path program 1 times [2019-09-08 12:28:40,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:40,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:40,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:40,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:40,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:40,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:40,320 INFO L87 Difference]: Start difference. First operand 20732 states and 26758 transitions. Second operand 3 states. [2019-09-08 12:28:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:45,014 INFO L93 Difference]: Finished difference Result 38080 states and 49328 transitions. [2019-09-08 12:28:45,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:45,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 12:28:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:45,031 INFO L225 Difference]: With dead ends: 38080 [2019-09-08 12:28:45,031 INFO L226 Difference]: Without dead ends: 20674 [2019-09-08 12:28:45,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20674 states. [2019-09-08 12:28:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20674 to 14844. [2019-09-08 12:28:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14844 states. [2019-09-08 12:28:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14844 states to 14844 states and 19004 transitions. [2019-09-08 12:28:49,153 INFO L78 Accepts]: Start accepts. Automaton has 14844 states and 19004 transitions. Word has length 160 [2019-09-08 12:28:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:49,154 INFO L475 AbstractCegarLoop]: Abstraction has 14844 states and 19004 transitions. [2019-09-08 12:28:49,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14844 states and 19004 transitions. [2019-09-08 12:28:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:28:49,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:49,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:49,158 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash 24098109, now seen corresponding path program 1 times [2019-09-08 12:28:49,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:49,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:49,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:28:49,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:28:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:28:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:28:49,266 INFO L87 Difference]: Start difference. First operand 14844 states and 19004 transitions. Second operand 6 states. [2019-09-08 12:28:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:55,948 INFO L93 Difference]: Finished difference Result 23560 states and 30593 transitions. [2019-09-08 12:28:55,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:28:55,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-09-08 12:28:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:55,967 INFO L225 Difference]: With dead ends: 23560 [2019-09-08 12:28:55,967 INFO L226 Difference]: Without dead ends: 23558 [2019-09-08 12:28:55,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:28:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2019-09-08 12:29:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 15148. [2019-09-08 12:29:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15148 states. [2019-09-08 12:29:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15148 states to 15148 states and 19268 transitions. [2019-09-08 12:29:00,331 INFO L78 Accepts]: Start accepts. Automaton has 15148 states and 19268 transitions. Word has length 160 [2019-09-08 12:29:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:00,331 INFO L475 AbstractCegarLoop]: Abstraction has 15148 states and 19268 transitions. [2019-09-08 12:29:00,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:29:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 15148 states and 19268 transitions. [2019-09-08 12:29:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:29:00,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:00,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:00,336 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -585902407, now seen corresponding path program 1 times [2019-09-08 12:29:00,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:00,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:00,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:00,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:00,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:00,408 INFO L87 Difference]: Start difference. First operand 15148 states and 19268 transitions. Second operand 3 states. [2019-09-08 12:29:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:04,860 INFO L93 Difference]: Finished difference Result 28680 states and 36610 transitions. [2019-09-08 12:29:04,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:04,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 12:29:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:04,874 INFO L225 Difference]: With dead ends: 28680 [2019-09-08 12:29:04,875 INFO L226 Difference]: Without dead ends: 15662 [2019-09-08 12:29:04,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2019-09-08 12:29:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 15556. [2019-09-08 12:29:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15556 states. [2019-09-08 12:29:09,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15556 states to 15556 states and 19564 transitions. [2019-09-08 12:29:09,460 INFO L78 Accepts]: Start accepts. Automaton has 15556 states and 19564 transitions. Word has length 160 [2019-09-08 12:29:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:09,460 INFO L475 AbstractCegarLoop]: Abstraction has 15556 states and 19564 transitions. [2019-09-08 12:29:09,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15556 states and 19564 transitions. [2019-09-08 12:29:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:29:09,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:09,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:09,465 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2116294546, now seen corresponding path program 1 times [2019-09-08 12:29:09,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:09,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:09,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:09,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:09,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:09,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:09,544 INFO L87 Difference]: Start difference. First operand 15556 states and 19564 transitions. Second operand 3 states. [2019-09-08 12:29:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:16,050 INFO L93 Difference]: Finished difference Result 34984 states and 44242 transitions. [2019-09-08 12:29:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:16,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 12:29:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:16,069 INFO L225 Difference]: With dead ends: 34984 [2019-09-08 12:29:16,069 INFO L226 Difference]: Without dead ends: 22614 [2019-09-08 12:29:16,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22614 states. [2019-09-08 12:29:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22614 to 22612. [2019-09-08 12:29:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22612 states. [2019-09-08 12:29:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22612 states to 22612 states and 28356 transitions. [2019-09-08 12:29:22,693 INFO L78 Accepts]: Start accepts. Automaton has 22612 states and 28356 transitions. Word has length 161 [2019-09-08 12:29:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:22,693 INFO L475 AbstractCegarLoop]: Abstraction has 22612 states and 28356 transitions. [2019-09-08 12:29:22,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 22612 states and 28356 transitions. [2019-09-08 12:29:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 12:29:22,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:22,706 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:22,707 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -722602318, now seen corresponding path program 1 times [2019-09-08 12:29:22,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:22,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:29:22,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:29:22,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:23,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 12:29:23,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:29:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:29:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:29:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:29:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:29:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:24,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:29:24,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2019-09-08 12:29:24,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:29:24,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:29:24,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:29:24,024 INFO L87 Difference]: Start difference. First operand 22612 states and 28356 transitions. Second operand 20 states. [2019-09-08 12:29:27,666 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-08 12:29:28,012 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 12:29:28,256 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:29:34,560 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 12:29:37,565 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:29:37,839 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:29:38,560 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-08 12:29:38,898 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:30:06,721 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:30:08,044 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 12:30:08,736 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 12:30:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:39,387 INFO L93 Difference]: Finished difference Result 206762 states and 266791 transitions. [2019-09-08 12:30:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-08 12:30:39,387 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 193 [2019-09-08 12:30:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:40,130 INFO L225 Difference]: With dead ends: 206762 [2019-09-08 12:30:40,131 INFO L226 Difference]: Without dead ends: 186280 [2019-09-08 12:30:40,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3961 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2076, Invalid=9696, Unknown=0, NotChecked=0, Total=11772 [2019-09-08 12:30:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186280 states. [2019-09-08 12:30:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186280 to 40744. [2019-09-08 12:30:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40744 states. [2019-09-08 12:30:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40744 states to 40744 states and 50188 transitions. [2019-09-08 12:30:55,844 INFO L78 Accepts]: Start accepts. Automaton has 40744 states and 50188 transitions. Word has length 193 [2019-09-08 12:30:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:55,844 INFO L475 AbstractCegarLoop]: Abstraction has 40744 states and 50188 transitions. [2019-09-08 12:30:55,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:30:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 40744 states and 50188 transitions. [2019-09-08 12:30:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 12:30:55,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:55,900 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:55,900 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1884011116, now seen corresponding path program 1 times [2019-09-08 12:30:55,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:56,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:30:56,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:30:56,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:30:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:56,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 12:30:56,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:30:56,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:30:56,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:30:56,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:30:56,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:30:57,129 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-08 12:30:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:57,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:30:57,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-08 12:30:57,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:30:57,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:30:57,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:30:57,242 INFO L87 Difference]: Start difference. First operand 40744 states and 50188 transitions. Second operand 22 states. [2019-09-08 12:31:01,761 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:31:01,994 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:31:05,744 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:31:05,913 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:31:06,362 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:31:06,718 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 12:31:06,877 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:31:07,152 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:31:07,512 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:31:07,896 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:31:09,817 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 12:31:10,359 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:31:10,635 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:31:10,804 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 12:31:10,970 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 12:31:13,142 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:31:14,255 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-08 12:31:15,027 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:31:15,214 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-08 12:31:15,389 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:31:15,967 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 12:31:20,856 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-08 12:31:21,057 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-08 12:31:21,727 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:31:21,961 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:31:23,080 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-08 12:31:23,338 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-08 12:31:24,161 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:31:24,435 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:31:24,636 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-08 12:31:24,851 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-08 12:31:25,810 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-08 12:31:26,020 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:31:26,230 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:31:26,400 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 12:31:36,867 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-08 12:31:38,375 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 12:31:38,559 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:31:39,534 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-08 12:31:39,725 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 12:31:39,914 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-08 12:31:42,484 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:31:43,419 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:31:43,581 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:31:44,122 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-08 12:31:44,367 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-08 12:31:44,573 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 12:31:44,749 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:31:44,931 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:31:45,929 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:31:46,137 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 12:31:46,333 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 12:31:46,502 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:31:47,238 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-08 12:31:47,449 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 12:31:47,657 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 12:31:47,893 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:31:48,131 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 12:31:48,320 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 12:31:48,505 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:31:48,691 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:31:50,507 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:31:52,250 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-08 12:31:52,460 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:31:52,653 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:31:52,880 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50