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.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:18:06,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:18:06,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:18:06,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:18:06,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:18:06,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:18:06,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:18:06,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:18:06,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:18:06,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:18:06,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:18:06,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:18:06,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:18:06,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:18:06,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:18:06,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:18:06,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:18:06,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:18:06,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:18:06,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:18:06,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:18:06,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:18:06,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:18:06,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:18:06,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:18:06,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:18:06,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:18:06,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:18:06,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:18:06,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:18:06,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:18:06,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:18:06,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:18:06,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:18:06,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:18:06,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:18:06,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:18:06,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:18:06,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:18:06,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:18:06,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:18:06,962 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:18:06,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:18:06,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:18:06,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:18:06,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:18:06,994 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:18:06,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:18:06,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:18:06,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:18:06,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:18:06,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:18:06,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:18:06,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:18:06,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:18:06,997 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:18:06,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:18:06,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:18:06,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:18:06,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:18:06,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:18:06,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:18:06,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:18:06,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:18:06,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:18:06,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:18:07,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:18:07,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:18:07,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:18:07,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:18:07,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:18:07,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:18:07,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:18:07,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:18:07,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:18:07,085 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:18:07,085 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.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 12:18:07,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3009f0f8c/718172537d1a4da69eb4ee71353a1c3e/FLAGddde003ff [2019-09-08 12:18:07,667 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:18:07,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 12:18:07,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3009f0f8c/718172537d1a4da69eb4ee71353a1c3e/FLAGddde003ff [2019-09-08 12:18:07,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3009f0f8c/718172537d1a4da69eb4ee71353a1c3e [2019-09-08 12:18:07,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:18:07,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:18:07,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:18:07,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:18:08,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:18:08,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:18:07" (1/1) ... [2019-09-08 12:18:08,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229794bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08, skipping insertion in model container [2019-09-08 12:18:08,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:18:07" (1/1) ... [2019-09-08 12:18:08,012 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:18:08,075 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:18:08,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:18:08,654 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:18:08,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:18:08,824 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:18:08,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08 WrapperNode [2019-09-08 12:18:08,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:18:08,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:18:08,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:18:08,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:18:08,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (1/1) ... [2019-09-08 12:18:08,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (1/1) ... [2019-09-08 12:18:08,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (1/1) ... [2019-09-08 12:18:08,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (1/1) ... [2019-09-08 12:18:08,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (1/1) ... [2019-09-08 12:18:08,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (1/1) ... [2019-09-08 12:18:08,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (1/1) ... [2019-09-08 12:18:08,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:18:08,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:18:08,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:18:08,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:18:08,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (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:18:09,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:18:09,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:18:09,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:18:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:18:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:18:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:18:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:18:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:18:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:18:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:18:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:18:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:18:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:18:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:18:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:18:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:18:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:18:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:18:09,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:18:09,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:18:09,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:18:10,061 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:18:10,062 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:18:10,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:18:10 BoogieIcfgContainer [2019-09-08 12:18:10,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:18:10,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:18:10,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:18:10,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:18:10,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:18:07" (1/3) ... [2019-09-08 12:18:10,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564dcdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:18:10, skipping insertion in model container [2019-09-08 12:18:10,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:08" (2/3) ... [2019-09-08 12:18:10,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564dcdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:18:10, skipping insertion in model container [2019-09-08 12:18:10,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:18:10" (3/3) ... [2019-09-08 12:18:10,077 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 12:18:10,088 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:18:10,111 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:18:10,127 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:18:10,157 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:18:10,158 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:18:10,158 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:18:10,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:18:10,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:18:10,159 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:18:10,159 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:18:10,159 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:18:10,159 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:18:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2019-09-08 12:18:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:18:10,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:10,202 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:18:10,204 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:10,209 INFO L82 PathProgramCache]: Analyzing trace with hash 171862004, now seen corresponding path program 1 times [2019-09-08 12:18:10,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:10,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:10,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:10,747 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:18:10,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:10,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:10,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:10,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:10,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:10,772 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 3 states. [2019-09-08 12:18:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:10,948 INFO L93 Difference]: Finished difference Result 355 states and 587 transitions. [2019-09-08 12:18:10,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:10,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 12:18:10,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:10,967 INFO L225 Difference]: With dead ends: 355 [2019-09-08 12:18:10,967 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 12:18:10,971 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:18:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 12:18:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2019-09-08 12:18:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-08 12:18:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 387 transitions. [2019-09-08 12:18:11,064 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 387 transitions. Word has length 95 [2019-09-08 12:18:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:11,065 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 387 transitions. [2019-09-08 12:18:11,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 387 transitions. [2019-09-08 12:18:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:18:11,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:11,075 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] [2019-09-08 12:18:11,078 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1189024244, now seen corresponding path program 1 times [2019-09-08 12:18:11,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:11,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:11,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:11,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:11,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:11,307 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:18:11,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:11,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:11,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:11,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:11,311 INFO L87 Difference]: Start difference. First operand 270 states and 387 transitions. Second operand 5 states. [2019-09-08 12:18:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:11,761 INFO L93 Difference]: Finished difference Result 672 states and 1010 transitions. [2019-09-08 12:18:11,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:11,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:18:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:11,766 INFO L225 Difference]: With dead ends: 672 [2019-09-08 12:18:11,766 INFO L226 Difference]: Without dead ends: 453 [2019-09-08 12:18:11,769 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:18:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-08 12:18:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 451. [2019-09-08 12:18:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-08 12:18:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 671 transitions. [2019-09-08 12:18:11,814 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 671 transitions. Word has length 97 [2019-09-08 12:18:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:11,814 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 671 transitions. [2019-09-08 12:18:11,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 671 transitions. [2019-09-08 12:18:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:18:11,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:11,819 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] [2019-09-08 12:18:11,819 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:11,820 INFO L82 PathProgramCache]: Analyzing trace with hash 119724555, now seen corresponding path program 1 times [2019-09-08 12:18:11,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:11,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:11,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:11,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:11,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:11,965 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:18:11,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:11,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:11,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:11,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:11,968 INFO L87 Difference]: Start difference. First operand 451 states and 671 transitions. Second operand 5 states. [2019-09-08 12:18:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:12,193 INFO L93 Difference]: Finished difference Result 847 states and 1286 transitions. [2019-09-08 12:18:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:12,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 12:18:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:12,201 INFO L225 Difference]: With dead ends: 847 [2019-09-08 12:18:12,201 INFO L226 Difference]: Without dead ends: 451 [2019-09-08 12:18:12,204 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:18:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-08 12:18:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2019-09-08 12:18:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-08 12:18:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 666 transitions. [2019-09-08 12:18:12,236 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 666 transitions. Word has length 98 [2019-09-08 12:18:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:12,237 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 666 transitions. [2019-09-08 12:18:12,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 666 transitions. [2019-09-08 12:18:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:18:12,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:12,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:12,241 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 540542213, now seen corresponding path program 1 times [2019-09-08 12:18:12,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:12,364 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:18:12,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:12,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:12,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:12,366 INFO L87 Difference]: Start difference. First operand 451 states and 666 transitions. Second operand 5 states. [2019-09-08 12:18:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:12,623 INFO L93 Difference]: Finished difference Result 839 states and 1267 transitions. [2019-09-08 12:18:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:12,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 12:18:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:12,627 INFO L225 Difference]: With dead ends: 839 [2019-09-08 12:18:12,627 INFO L226 Difference]: Without dead ends: 451 [2019-09-08 12:18:12,629 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:18:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-08 12:18:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2019-09-08 12:18:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-08 12:18:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 661 transitions. [2019-09-08 12:18:12,659 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 661 transitions. Word has length 99 [2019-09-08 12:18:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:12,659 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 661 transitions. [2019-09-08 12:18:12,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 661 transitions. [2019-09-08 12:18:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:12,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:12,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:12,662 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:12,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:12,662 INFO L82 PathProgramCache]: Analyzing trace with hash 298030891, now seen corresponding path program 1 times [2019-09-08 12:18:12,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:12,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:12,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:12,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:12,778 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:18:12,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:12,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:12,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:12,781 INFO L87 Difference]: Start difference. First operand 451 states and 661 transitions. Second operand 5 states. [2019-09-08 12:18:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:13,017 INFO L93 Difference]: Finished difference Result 835 states and 1253 transitions. [2019-09-08 12:18:13,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:13,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:18:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:13,023 INFO L225 Difference]: With dead ends: 835 [2019-09-08 12:18:13,023 INFO L226 Difference]: Without dead ends: 451 [2019-09-08 12:18:13,025 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:18:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-08 12:18:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2019-09-08 12:18:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-08 12:18:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 656 transitions. [2019-09-08 12:18:13,055 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 656 transitions. Word has length 100 [2019-09-08 12:18:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:13,056 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 656 transitions. [2019-09-08 12:18:13,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 656 transitions. [2019-09-08 12:18:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:18:13,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:13,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:13,058 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash -317145100, now seen corresponding path program 1 times [2019-09-08 12:18:13,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:13,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:13,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:13,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:13,164 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:18:13,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:13,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:13,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:13,166 INFO L87 Difference]: Start difference. First operand 451 states and 656 transitions. Second operand 5 states. [2019-09-08 12:18:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:13,443 INFO L93 Difference]: Finished difference Result 843 states and 1252 transitions. [2019-09-08 12:18:13,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:13,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 12:18:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:13,448 INFO L225 Difference]: With dead ends: 843 [2019-09-08 12:18:13,448 INFO L226 Difference]: Without dead ends: 451 [2019-09-08 12:18:13,450 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:18:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-08 12:18:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2019-09-08 12:18:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-08 12:18:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 651 transitions. [2019-09-08 12:18:13,486 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 651 transitions. Word has length 101 [2019-09-08 12:18:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:13,487 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 651 transitions. [2019-09-08 12:18:13,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 651 transitions. [2019-09-08 12:18:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:18:13,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:13,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] [2019-09-08 12:18:13,490 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash -761237271, now seen corresponding path program 1 times [2019-09-08 12:18:13,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:13,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:13,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:13,670 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:18:13,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:13,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:13,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:13,673 INFO L87 Difference]: Start difference. First operand 451 states and 651 transitions. Second operand 5 states. [2019-09-08 12:18:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:13,924 INFO L93 Difference]: Finished difference Result 831 states and 1230 transitions. [2019-09-08 12:18:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:13,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 12:18:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:13,928 INFO L225 Difference]: With dead ends: 831 [2019-09-08 12:18:13,928 INFO L226 Difference]: Without dead ends: 451 [2019-09-08 12:18:13,930 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:18:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-08 12:18:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2019-09-08 12:18:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-08 12:18:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 646 transitions. [2019-09-08 12:18:13,966 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 646 transitions. Word has length 102 [2019-09-08 12:18:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:13,966 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 646 transitions. [2019-09-08 12:18:13,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 646 transitions. [2019-09-08 12:18:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:13,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:13,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:13,969 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1874562471, now seen corresponding path program 1 times [2019-09-08 12:18:13,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:13,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:13,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:14,214 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:18:14,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:14,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:14,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:14,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:14,217 INFO L87 Difference]: Start difference. First operand 451 states and 646 transitions. Second operand 8 states. [2019-09-08 12:18:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:14,763 INFO L93 Difference]: Finished difference Result 2278 states and 3388 transitions. [2019-09-08 12:18:14,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:14,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:18:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:14,774 INFO L225 Difference]: With dead ends: 2278 [2019-09-08 12:18:14,774 INFO L226 Difference]: Without dead ends: 2008 [2019-09-08 12:18:14,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:18:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-09-08 12:18:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 584. [2019-09-08 12:18:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 12:18:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 847 transitions. [2019-09-08 12:18:14,856 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 847 transitions. Word has length 103 [2019-09-08 12:18:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:14,856 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 847 transitions. [2019-09-08 12:18:14,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 847 transitions. [2019-09-08 12:18:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:14,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:14,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:14,861 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:14,862 INFO L82 PathProgramCache]: Analyzing trace with hash 536999613, now seen corresponding path program 1 times [2019-09-08 12:18:14,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:14,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:14,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:15,115 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:18:15,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:15,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:15,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:15,116 INFO L87 Difference]: Start difference. First operand 584 states and 847 transitions. Second operand 8 states. [2019-09-08 12:18:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:15,650 INFO L93 Difference]: Finished difference Result 2392 states and 3562 transitions. [2019-09-08 12:18:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:15,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:18:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:15,662 INFO L225 Difference]: With dead ends: 2392 [2019-09-08 12:18:15,662 INFO L226 Difference]: Without dead ends: 2122 [2019-09-08 12:18:15,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:18:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-08 12:18:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 918. [2019-09-08 12:18:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-09-08 12:18:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1356 transitions. [2019-09-08 12:18:15,796 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1356 transitions. Word has length 103 [2019-09-08 12:18:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:15,797 INFO L475 AbstractCegarLoop]: Abstraction has 918 states and 1356 transitions. [2019-09-08 12:18:15,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1356 transitions. [2019-09-08 12:18:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:15,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:15,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:15,799 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:15,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:15,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1732033126, now seen corresponding path program 1 times [2019-09-08 12:18:15,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:15,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:15,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:15,925 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:18:15,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:15,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:15,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:15,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:15,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:15,927 INFO L87 Difference]: Start difference. First operand 918 states and 1356 transitions. Second operand 5 states. [2019-09-08 12:18:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:16,240 INFO L93 Difference]: Finished difference Result 1814 states and 2703 transitions. [2019-09-08 12:18:16,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:16,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 12:18:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:16,248 INFO L225 Difference]: With dead ends: 1814 [2019-09-08 12:18:16,251 INFO L226 Difference]: Without dead ends: 1544 [2019-09-08 12:18:16,253 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:18:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-09-08 12:18:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1354. [2019-09-08 12:18:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-09-08 12:18:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 2017 transitions. [2019-09-08 12:18:16,411 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 2017 transitions. Word has length 103 [2019-09-08 12:18:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:16,412 INFO L475 AbstractCegarLoop]: Abstraction has 1354 states and 2017 transitions. [2019-09-08 12:18:16,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2017 transitions. [2019-09-08 12:18:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:16,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:16,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:16,414 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:16,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash -362799159, now seen corresponding path program 1 times [2019-09-08 12:18:16,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:16,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:16,496 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:18:16,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:16,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:16,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:16,498 INFO L87 Difference]: Start difference. First operand 1354 states and 2017 transitions. Second operand 3 states. [2019-09-08 12:18:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:16,700 INFO L93 Difference]: Finished difference Result 2592 states and 3886 transitions. [2019-09-08 12:18:16,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:16,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 12:18:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:16,709 INFO L225 Difference]: With dead ends: 2592 [2019-09-08 12:18:16,709 INFO L226 Difference]: Without dead ends: 1494 [2019-09-08 12:18:16,712 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:18:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-09-08 12:18:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1492. [2019-09-08 12:18:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2019-09-08 12:18:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2210 transitions. [2019-09-08 12:18:16,903 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2210 transitions. Word has length 103 [2019-09-08 12:18:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:16,903 INFO L475 AbstractCegarLoop]: Abstraction has 1492 states and 2210 transitions. [2019-09-08 12:18:16,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2210 transitions. [2019-09-08 12:18:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:16,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:16,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] [2019-09-08 12:18:16,905 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:16,906 INFO L82 PathProgramCache]: Analyzing trace with hash -604016886, now seen corresponding path program 1 times [2019-09-08 12:18:16,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:16,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:16,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:16,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:16,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:16,980 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:18:16,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:16,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:18:16,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:18:16,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:18:16,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:18:16,982 INFO L87 Difference]: Start difference. First operand 1492 states and 2210 transitions. Second operand 3 states. [2019-09-08 12:18:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:17,354 INFO L93 Difference]: Finished difference Result 3852 states and 5724 transitions. [2019-09-08 12:18:17,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:18:17,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 12:18:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:17,370 INFO L225 Difference]: With dead ends: 3852 [2019-09-08 12:18:17,370 INFO L226 Difference]: Without dead ends: 2616 [2019-09-08 12:18:17,376 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:18:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2019-09-08 12:18:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2614. [2019-09-08 12:18:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-09-08 12:18:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 3839 transitions. [2019-09-08 12:18:17,770 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 3839 transitions. Word has length 103 [2019-09-08 12:18:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:17,770 INFO L475 AbstractCegarLoop]: Abstraction has 2614 states and 3839 transitions. [2019-09-08 12:18:17,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:18:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3839 transitions. [2019-09-08 12:18:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:17,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:17,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:17,772 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash 258657232, now seen corresponding path program 1 times [2019-09-08 12:18:17,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:17,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:17,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:17,882 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:18:17,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:17,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:17,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:17,884 INFO L87 Difference]: Start difference. First operand 2614 states and 3839 transitions. Second operand 5 states. [2019-09-08 12:18:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:18,323 INFO L93 Difference]: Finished difference Result 4204 states and 6180 transitions. [2019-09-08 12:18:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:18,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 12:18:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:18,341 INFO L225 Difference]: With dead ends: 4204 [2019-09-08 12:18:18,341 INFO L226 Difference]: Without dead ends: 3162 [2019-09-08 12:18:18,345 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:18:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2019-09-08 12:18:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2878. [2019-09-08 12:18:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2878 states. [2019-09-08 12:18:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 4229 transitions. [2019-09-08 12:18:18,710 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 4229 transitions. Word has length 103 [2019-09-08 12:18:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:18,711 INFO L475 AbstractCegarLoop]: Abstraction has 2878 states and 4229 transitions. [2019-09-08 12:18:18,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 4229 transitions. [2019-09-08 12:18:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:18,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:18,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:18,713 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:18,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1863479507, now seen corresponding path program 1 times [2019-09-08 12:18:18,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:18,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:18,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:18,908 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:18:18,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:18,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:18,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:18,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:18,912 INFO L87 Difference]: Start difference. First operand 2878 states and 4229 transitions. Second operand 8 states. [2019-09-08 12:18:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:20,243 INFO L93 Difference]: Finished difference Result 9791 states and 14449 transitions. [2019-09-08 12:18:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:20,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:18:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:20,301 INFO L225 Difference]: With dead ends: 9791 [2019-09-08 12:18:20,301 INFO L226 Difference]: Without dead ends: 8487 [2019-09-08 12:18:20,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:18:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-09-08 12:18:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 3416. [2019-09-08 12:18:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2019-09-08 12:18:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5023 transitions. [2019-09-08 12:18:20,861 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5023 transitions. Word has length 103 [2019-09-08 12:18:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:20,861 INFO L475 AbstractCegarLoop]: Abstraction has 3416 states and 5023 transitions. [2019-09-08 12:18:20,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5023 transitions. [2019-09-08 12:18:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:18:20,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:20,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:20,865 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:20,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1229981692, now seen corresponding path program 1 times [2019-09-08 12:18:20,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:20,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:20,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:20,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:21,041 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:18:21,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:21,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:21,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:21,043 INFO L87 Difference]: Start difference. First operand 3416 states and 5023 transitions. Second operand 8 states. [2019-09-08 12:18:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:22,537 INFO L93 Difference]: Finished difference Result 10207 states and 15067 transitions. [2019-09-08 12:18:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:22,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-09-08 12:18:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:22,565 INFO L225 Difference]: With dead ends: 10207 [2019-09-08 12:18:22,565 INFO L226 Difference]: Without dead ends: 8903 [2019-09-08 12:18:22,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:18:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8903 states. [2019-09-08 12:18:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8903 to 3979. [2019-09-08 12:18:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3979 states. [2019-09-08 12:18:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 5857 transitions. [2019-09-08 12:18:23,110 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 5857 transitions. Word has length 103 [2019-09-08 12:18:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:23,110 INFO L475 AbstractCegarLoop]: Abstraction has 3979 states and 5857 transitions. [2019-09-08 12:18:23,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 5857 transitions. [2019-09-08 12:18:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:18:23,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:23,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] [2019-09-08 12:18:23,113 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:23,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1636218723, now seen corresponding path program 1 times [2019-09-08 12:18:23,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:23,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:23,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:23,214 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:18:23,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:23,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:23,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:23,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:23,216 INFO L87 Difference]: Start difference. First operand 3979 states and 5857 transitions. Second operand 5 states. [2019-09-08 12:18:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:24,177 INFO L93 Difference]: Finished difference Result 6713 states and 9877 transitions. [2019-09-08 12:18:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:18:24,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 12:18:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:24,194 INFO L225 Difference]: With dead ends: 6713 [2019-09-08 12:18:24,194 INFO L226 Difference]: Without dead ends: 6711 [2019-09-08 12:18:24,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:18:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6711 states. [2019-09-08 12:18:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6711 to 4007. [2019-09-08 12:18:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-09-08 12:18:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5873 transitions. [2019-09-08 12:18:24,903 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5873 transitions. Word has length 104 [2019-09-08 12:18:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:24,903 INFO L475 AbstractCegarLoop]: Abstraction has 4007 states and 5873 transitions. [2019-09-08 12:18:24,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5873 transitions. [2019-09-08 12:18:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:18:24,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:24,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] [2019-09-08 12:18:24,906 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1313866017, now seen corresponding path program 1 times [2019-09-08 12:18:24,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:24,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:25,000 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:18:25,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:25,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:18:25,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:18:25,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:18:25,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:18:25,002 INFO L87 Difference]: Start difference. First operand 4007 states and 5873 transitions. Second operand 4 states. [2019-09-08 12:18:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:25,644 INFO L93 Difference]: Finished difference Result 9354 states and 13735 transitions. [2019-09-08 12:18:25,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:18:25,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 12:18:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:25,658 INFO L225 Difference]: With dead ends: 9354 [2019-09-08 12:18:25,658 INFO L226 Difference]: Without dead ends: 5654 [2019-09-08 12:18:25,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:18:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2019-09-08 12:18:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 5652. [2019-09-08 12:18:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-09-08 12:18:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 8262 transitions. [2019-09-08 12:18:26,354 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 8262 transitions. Word has length 104 [2019-09-08 12:18:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:26,355 INFO L475 AbstractCegarLoop]: Abstraction has 5652 states and 8262 transitions. [2019-09-08 12:18:26,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:18:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 8262 transitions. [2019-09-08 12:18:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:18:26,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:26,357 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] [2019-09-08 12:18:26,357 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash -235929603, now seen corresponding path program 1 times [2019-09-08 12:18:26,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:26,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:26,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:26,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:26,594 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:18:26,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:26,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:18:26,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:18:26,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:18:26,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:18:26,596 INFO L87 Difference]: Start difference. First operand 5652 states and 8262 transitions. Second operand 10 states. [2019-09-08 12:18:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:29,240 INFO L93 Difference]: Finished difference Result 16674 states and 24330 transitions. [2019-09-08 12:18:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:18:29,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 12:18:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:29,257 INFO L225 Difference]: With dead ends: 16674 [2019-09-08 12:18:29,257 INFO L226 Difference]: Without dead ends: 11171 [2019-09-08 12:18:29,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:18:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11171 states. [2019-09-08 12:18:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11171 to 5652. [2019-09-08 12:18:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-09-08 12:18:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 8259 transitions. [2019-09-08 12:18:29,940 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 8259 transitions. Word has length 105 [2019-09-08 12:18:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:29,940 INFO L475 AbstractCegarLoop]: Abstraction has 5652 states and 8259 transitions. [2019-09-08 12:18:29,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:18:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 8259 transitions. [2019-09-08 12:18:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:18:29,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:29,942 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] [2019-09-08 12:18:29,943 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:29,943 INFO L82 PathProgramCache]: Analyzing trace with hash 457052476, now seen corresponding path program 1 times [2019-09-08 12:18:29,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:29,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:29,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:29,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:29,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:30,188 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:18:30,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:30,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:18:30,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:18:30,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:18:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:18:30,191 INFO L87 Difference]: Start difference. First operand 5652 states and 8259 transitions. Second operand 10 states. [2019-09-08 12:18:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:32,419 INFO L93 Difference]: Finished difference Result 16687 states and 24349 transitions. [2019-09-08 12:18:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:18:32,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 12:18:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:32,439 INFO L225 Difference]: With dead ends: 16687 [2019-09-08 12:18:32,439 INFO L226 Difference]: Without dead ends: 11274 [2019-09-08 12:18:32,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:18:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11274 states. [2019-09-08 12:18:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11274 to 5652. [2019-09-08 12:18:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-09-08 12:18:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 8248 transitions. [2019-09-08 12:18:33,782 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 8248 transitions. Word has length 105 [2019-09-08 12:18:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:33,782 INFO L475 AbstractCegarLoop]: Abstraction has 5652 states and 8248 transitions. [2019-09-08 12:18:33,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:18:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 8248 transitions. [2019-09-08 12:18:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:18:33,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:33,787 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] [2019-09-08 12:18:33,787 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:33,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 123712296, now seen corresponding path program 1 times [2019-09-08 12:18:33,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:33,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:33,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:33,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:34,045 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:18:34,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:34,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:34,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:34,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:34,047 INFO L87 Difference]: Start difference. First operand 5652 states and 8248 transitions. Second operand 9 states. [2019-09-08 12:18:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:36,270 INFO L93 Difference]: Finished difference Result 15566 states and 22766 transitions. [2019-09-08 12:18:36,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 12:18:36,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:18:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:36,288 INFO L225 Difference]: With dead ends: 15566 [2019-09-08 12:18:36,288 INFO L226 Difference]: Without dead ends: 11010 [2019-09-08 12:18:36,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:18:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states. [2019-09-08 12:18:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 5652. [2019-09-08 12:18:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-09-08 12:18:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 8247 transitions. [2019-09-08 12:18:37,540 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 8247 transitions. Word has length 105 [2019-09-08 12:18:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:37,540 INFO L475 AbstractCegarLoop]: Abstraction has 5652 states and 8247 transitions. [2019-09-08 12:18:37,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 8247 transitions. [2019-09-08 12:18:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:18:37,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:37,542 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] [2019-09-08 12:18:37,543 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1720709662, now seen corresponding path program 1 times [2019-09-08 12:18:37,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:37,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:37,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:37,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:37,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:37,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:18:37,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:18:37,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:18:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:18:37,761 INFO L87 Difference]: Start difference. First operand 5652 states and 8247 transitions. Second operand 10 states. [2019-09-08 12:18:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:40,152 INFO L93 Difference]: Finished difference Result 16807 states and 24511 transitions. [2019-09-08 12:18:40,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:18:40,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-09-08 12:18:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:40,165 INFO L225 Difference]: With dead ends: 16807 [2019-09-08 12:18:40,165 INFO L226 Difference]: Without dead ends: 11319 [2019-09-08 12:18:40,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:18:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2019-09-08 12:18:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 5652. [2019-09-08 12:18:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-09-08 12:18:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 8241 transitions. [2019-09-08 12:18:41,007 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 8241 transitions. Word has length 106 [2019-09-08 12:18:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:41,007 INFO L475 AbstractCegarLoop]: Abstraction has 5652 states and 8241 transitions. [2019-09-08 12:18:41,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:18:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 8241 transitions. [2019-09-08 12:18:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:18:41,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:41,009 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] [2019-09-08 12:18:41,009 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1487430692, now seen corresponding path program 1 times [2019-09-08 12:18:41,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:41,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:41,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:41,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:41,214 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:18:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:18:41,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:18:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:18:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:18:41,217 INFO L87 Difference]: Start difference. First operand 5652 states and 8241 transitions. Second operand 10 states. [2019-09-08 12:18:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:43,806 INFO L93 Difference]: Finished difference Result 16587 states and 24171 transitions. [2019-09-08 12:18:43,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:18:43,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-09-08 12:18:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:43,824 INFO L225 Difference]: With dead ends: 16587 [2019-09-08 12:18:43,825 INFO L226 Difference]: Without dead ends: 11229 [2019-09-08 12:18:43,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:18:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11229 states. [2019-09-08 12:18:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11229 to 5652. [2019-09-08 12:18:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-09-08 12:18:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 8228 transitions. [2019-09-08 12:18:44,800 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 8228 transitions. Word has length 107 [2019-09-08 12:18:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:44,801 INFO L475 AbstractCegarLoop]: Abstraction has 5652 states and 8228 transitions. [2019-09-08 12:18:44,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:18:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 8228 transitions. [2019-09-08 12:18:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:18:44,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:44,802 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] [2019-09-08 12:18:44,803 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1512655426, now seen corresponding path program 1 times [2019-09-08 12:18:44,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:44,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:45,039 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:18:45,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:45,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:18:45,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:18:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:18:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:18:45,041 INFO L87 Difference]: Start difference. First operand 5652 states and 8228 transitions. Second operand 10 states. [2019-09-08 12:18:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:47,606 INFO L93 Difference]: Finished difference Result 16762 states and 24398 transitions. [2019-09-08 12:18:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:18:47,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2019-09-08 12:18:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:47,618 INFO L225 Difference]: With dead ends: 16762 [2019-09-08 12:18:47,619 INFO L226 Difference]: Without dead ends: 11304 [2019-09-08 12:18:47,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:18:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2019-09-08 12:18:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 5652. [2019-09-08 12:18:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5652 states. [2019-09-08 12:18:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5652 states to 5652 states and 8219 transitions. [2019-09-08 12:18:48,524 INFO L78 Accepts]: Start accepts. Automaton has 5652 states and 8219 transitions. Word has length 108 [2019-09-08 12:18:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:48,524 INFO L475 AbstractCegarLoop]: Abstraction has 5652 states and 8219 transitions. [2019-09-08 12:18:48,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:18:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5652 states and 8219 transitions. [2019-09-08 12:18:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:18:48,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:48,526 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] [2019-09-08 12:18:48,526 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1141422456, now seen corresponding path program 1 times [2019-09-08 12:18:48,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:48,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:49,712 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:18:49,853 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:18:50,027 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 12:18:50,172 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:18:50,373 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-08 12:18:50,543 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-08 12:18:52,071 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:18:52,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:52,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:18:52,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:18:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:18:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1164, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:18:52,073 INFO L87 Difference]: Start difference. First operand 5652 states and 8219 transitions. Second operand 36 states. [2019-09-08 12:18:52,275 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:18:53,451 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-08 12:18:53,649 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-08 12:18:53,851 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 12:18:54,261 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:18:54,795 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-08 12:18:55,178 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-09-08 12:18:55,694 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 99 [2019-09-08 12:18:56,249 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2019-09-08 12:18:56,955 WARN L188 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2019-09-08 12:18:57,632 WARN L188 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-09-08 12:18:58,433 WARN L188 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 138 [2019-09-08 12:18:59,352 WARN L188 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 157 [2019-09-08 12:19:00,765 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 190 DAG size of output: 170 [2019-09-08 12:19:01,099 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-09-08 12:19:01,434 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2019-09-08 12:19:01,841 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-08 12:19:02,198 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-09-08 12:19:02,827 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-08 12:19:03,366 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-08 12:19:03,859 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 12:19:04,376 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-08 12:19:05,168 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:19:05,758 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:19:06,633 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-08 12:19:07,241 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-08 12:19:14,967 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:19:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:18,213 INFO L93 Difference]: Finished difference Result 31545 states and 46127 transitions. [2019-09-08 12:19:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 12:19:18,214 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2019-09-08 12:19:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:18,243 INFO L225 Difference]: With dead ends: 31545 [2019-09-08 12:19:18,244 INFO L226 Difference]: Without dead ends: 29256 [2019-09-08 12:19:18,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1089, Invalid=5073, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 12:19:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29256 states. [2019-09-08 12:19:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29256 to 5677. [2019-09-08 12:19:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5677 states. [2019-09-08 12:19:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 8250 transitions. [2019-09-08 12:19:19,571 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 8250 transitions. Word has length 109 [2019-09-08 12:19:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:19,572 INFO L475 AbstractCegarLoop]: Abstraction has 5677 states and 8250 transitions. [2019-09-08 12:19:19,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:19:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 8250 transitions. [2019-09-08 12:19:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:19:19,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:19,573 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] [2019-09-08 12:19:19,573 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash -962103610, now seen corresponding path program 1 times [2019-09-08 12:19:19,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:19,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:20,540 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:19:21,051 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2019-09-08 12:19:21,413 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,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:19:21,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:19:21,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:19:21,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:19:21,415 INFO L87 Difference]: Start difference. First operand 5677 states and 8250 transitions. Second operand 25 states. [2019-09-08 12:19:22,456 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:19:22,732 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:19:23,111 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-08 12:19:23,509 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-09-08 12:19:23,996 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-09-08 12:19:24,521 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2019-09-08 12:19:24,756 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-08 12:19:24,906 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 12:19:25,286 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:19:25,722 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:19:25,986 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:19:26,343 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:19:26,817 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:19:27,223 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:19:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:33,160 INFO L93 Difference]: Finished difference Result 20970 states and 30628 transitions. [2019-09-08 12:19:33,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:19:33,161 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2019-09-08 12:19:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:33,183 INFO L225 Difference]: With dead ends: 20970 [2019-09-08 12:19:33,183 INFO L226 Difference]: Without dead ends: 18188 [2019-09-08 12:19:33,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:19:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18188 states. [2019-09-08 12:19:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18188 to 5687. [2019-09-08 12:19:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5687 states. [2019-09-08 12:19:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 8256 transitions. [2019-09-08 12:19:34,704 INFO L78 Accepts]: Start accepts. Automaton has 5687 states and 8256 transitions. Word has length 109 [2019-09-08 12:19:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:34,704 INFO L475 AbstractCegarLoop]: Abstraction has 5687 states and 8256 transitions. [2019-09-08 12:19:34,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:19:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5687 states and 8256 transitions. [2019-09-08 12:19:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:19:34,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:34,706 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] [2019-09-08 12:19:34,706 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:34,706 INFO L82 PathProgramCache]: Analyzing trace with hash -279703384, now seen corresponding path program 1 times [2019-09-08 12:19:34,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:34,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:34,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:34,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:35,691 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:19:35,854 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 12:19:36,004 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:19:36,190 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-08 12:19:36,343 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 12:19:36,529 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:19:37,162 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:19:38,585 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:38,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:38,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:19:38,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:19:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:19:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1187, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:19:38,587 INFO L87 Difference]: Start difference. First operand 5687 states and 8256 transitions. Second operand 36 states. [2019-09-08 12:19:38,827 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-09-08 12:19:40,204 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-08 12:19:40,419 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-08 12:19:41,104 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-08 12:19:41,448 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-09-08 12:19:41,800 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-09-08 12:19:42,262 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 80 [2019-09-08 12:19:43,029 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 86 [2019-09-08 12:19:43,604 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 98 [2019-09-08 12:19:44,201 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 104 [2019-09-08 12:19:44,956 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 124 [2019-09-08 12:19:45,876 WARN L188 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 143 [2019-09-08 12:19:46,977 WARN L188 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 169 [2019-09-08 12:19:47,407 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2019-09-08 12:19:47,819 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2019-09-08 12:19:48,164 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-09-08 12:19:52,013 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2019-09-08 12:20:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:05,199 INFO L93 Difference]: Finished difference Result 23493 states and 34322 transitions. [2019-09-08 12:20:05,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 12:20:05,200 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2019-09-08 12:20:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:05,223 INFO L225 Difference]: With dead ends: 23493 [2019-09-08 12:20:05,223 INFO L226 Difference]: Without dead ends: 21861 [2019-09-08 12:20:05,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=705, Invalid=3851, Unknown=0, NotChecked=0, Total=4556 [2019-09-08 12:20:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21861 states. [2019-09-08 12:20:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21861 to 5725. [2019-09-08 12:20:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5725 states. [2019-09-08 12:20:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 8305 transitions. [2019-09-08 12:20:06,928 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 8305 transitions. Word has length 109 [2019-09-08 12:20:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:06,929 INFO L475 AbstractCegarLoop]: Abstraction has 5725 states and 8305 transitions. [2019-09-08 12:20:06,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:20:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 8305 transitions. [2019-09-08 12:20:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:20:06,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:06,930 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] [2019-09-08 12:20:06,930 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -684647096, now seen corresponding path program 1 times [2019-09-08 12:20:06,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:06,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:06,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:08,326 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:20:08,488 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:20:08,928 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:20:09,562 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:20:10,993 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:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:20:10,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:20:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:20:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:20:10,995 INFO L87 Difference]: Start difference. First operand 5725 states and 8305 transitions. Second operand 36 states. [2019-09-08 12:20:11,196 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 12:20:12,246 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:20:12,429 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:20:12,961 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 12:20:13,318 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:20:13,647 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-09-08 12:20:14,108 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2019-09-08 12:20:14,655 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 119 [2019-09-08 12:20:15,407 WARN L188 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 134 [2019-09-08 12:20:16,363 WARN L188 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 155 [2019-09-08 12:20:28,404 WARN L188 SmtUtils]: Spent 11.90 s on a formula simplification. DAG size of input: 194 DAG size of output: 177 [2019-09-08 12:20:58,808 WARN L188 SmtUtils]: Spent 30.26 s on a formula simplification. DAG size of input: 215 DAG size of output: 197 [2019-09-08 12:21:29,267 WARN L188 SmtUtils]: Spent 30.33 s on a formula simplification. DAG size of input: 231 DAG size of output: 213 [2019-09-08 12:21:29,684 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-08 12:21:29,992 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-08 12:21:30,226 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-08 12:21:30,467 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-08 12:21:30,761 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-08 12:21:30,964 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-08 12:21:31,393 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-08 12:21:31,725 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-08 12:21:32,330 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-08 12:21:32,558 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-08 12:21:33,130 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-08 12:21:33,398 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 12:21:34,010 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-08 12:21:35,731 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-08 12:21:36,651 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-08 12:21:37,219 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-08 12:21:37,970 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-08 12:21:51,594 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:21:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:57,212 INFO L93 Difference]: Finished difference Result 32126 states and 46900 transitions. [2019-09-08 12:21:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 12:21:57,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2019-09-08 12:21:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:57,240 INFO L225 Difference]: With dead ends: 32126 [2019-09-08 12:21:57,240 INFO L226 Difference]: Without dead ends: 29837 [2019-09-08 12:21:57,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 85.9s TimeCoverageRelationStatistics Valid=1352, Invalid=7204, Unknown=0, NotChecked=0, Total=8556 [2019-09-08 12:21:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29837 states. [2019-09-08 12:21:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29837 to 5765. [2019-09-08 12:21:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-09-08 12:21:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 8360 transitions. [2019-09-08 12:21:59,139 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 8360 transitions. Word has length 109 [2019-09-08 12:21:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:59,139 INFO L475 AbstractCegarLoop]: Abstraction has 5765 states and 8360 transitions. [2019-09-08 12:21:59,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:21:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 8360 transitions. [2019-09-08 12:21:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:21:59,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:59,140 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] [2019-09-08 12:21:59,141 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1344722937, now seen corresponding path program 1 times [2019-09-08 12:21:59,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:59,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:59,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:59,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:59,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:00,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:00,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:22:00,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:22:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:22:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:22:00,005 INFO L87 Difference]: Start difference. First operand 5765 states and 8360 transitions. Second operand 17 states. [2019-09-08 12:22:00,625 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-08 12:22:00,805 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:22:01,071 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2019-09-08 12:22:01,262 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:22:01,448 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:22:01,705 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 12:22:01,917 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:22:02,092 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:22:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:09,166 INFO L93 Difference]: Finished difference Result 19637 states and 28685 transitions. [2019-09-08 12:22:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:22:09,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2019-09-08 12:22:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:09,181 INFO L225 Difference]: With dead ends: 19637 [2019-09-08 12:22:09,181 INFO L226 Difference]: Without dead ends: 17278 [2019-09-08 12:22:09,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:22:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17278 states. [2019-09-08 12:22:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17278 to 5740. [2019-09-08 12:22:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5740 states. [2019-09-08 12:22:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 8323 transitions. [2019-09-08 12:22:11,184 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 8323 transitions. Word has length 109 [2019-09-08 12:22:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:11,185 INFO L475 AbstractCegarLoop]: Abstraction has 5740 states and 8323 transitions. [2019-09-08 12:22:11,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:22:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 8323 transitions. [2019-09-08 12:22:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:22:11,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:11,186 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] [2019-09-08 12:22:11,186 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:11,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:11,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1244058685, now seen corresponding path program 1 times [2019-09-08 12:22:11,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:11,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:11,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:11,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:11,755 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:11,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:11,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:22:11,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:22:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:22:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:22:11,756 INFO L87 Difference]: Start difference. First operand 5740 states and 8323 transitions. Second operand 13 states. [2019-09-08 12:22:12,118 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:22:12,293 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:22:12,486 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:22:12,824 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:22:13,063 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:22:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:17,711 INFO L93 Difference]: Finished difference Result 15090 states and 22000 transitions. [2019-09-08 12:22:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:22:17,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-09-08 12:22:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:17,721 INFO L225 Difference]: With dead ends: 15090 [2019-09-08 12:22:17,721 INFO L226 Difference]: Without dead ends: 12263 [2019-09-08 12:22:17,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:22:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12263 states. [2019-09-08 12:22:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12263 to 5669. [2019-09-08 12:22:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5669 states. [2019-09-08 12:22:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 8231 transitions. [2019-09-08 12:22:19,779 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 8231 transitions. Word has length 110 [2019-09-08 12:22:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:19,779 INFO L475 AbstractCegarLoop]: Abstraction has 5669 states and 8231 transitions. [2019-09-08 12:22:19,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:22:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 8231 transitions. [2019-09-08 12:22:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:22:19,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:19,781 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] [2019-09-08 12:22:19,781 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash -841865213, now seen corresponding path program 1 times [2019-09-08 12:22:19,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:19,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:19,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:19,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:19,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:20,774 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:20,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:20,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:22:20,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:22:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:22:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:22:20,775 INFO L87 Difference]: Start difference. First operand 5669 states and 8231 transitions. Second operand 18 states. [2019-09-08 12:22:21,538 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-08 12:22:21,746 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 12:22:22,060 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-08 12:22:22,260 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:22:22,454 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 12:22:22,684 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 12:22:22,916 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:22:23,106 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:22:23,251 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-08 12:22:23,466 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 12:22:23,631 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 12:22:23,899 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-08 12:22:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:36,864 INFO L93 Difference]: Finished difference Result 34951 states and 51179 transitions. [2019-09-08 12:22:36,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:22:36,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2019-09-08 12:22:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:36,895 INFO L225 Difference]: With dead ends: 34951 [2019-09-08 12:22:36,895 INFO L226 Difference]: Without dead ends: 33319 [2019-09-08 12:22:36,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=298, Invalid=1108, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:22:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33319 states. [2019-09-08 12:22:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33319 to 5650. [2019-09-08 12:22:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-09-08 12:22:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8202 transitions. [2019-09-08 12:22:39,227 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8202 transitions. Word has length 110 [2019-09-08 12:22:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:39,227 INFO L475 AbstractCegarLoop]: Abstraction has 5650 states and 8202 transitions. [2019-09-08 12:22:39,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:22:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8202 transitions. [2019-09-08 12:22:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:22:39,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:39,229 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] [2019-09-08 12:22:39,229 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1246808925, now seen corresponding path program 1 times [2019-09-08 12:22:39,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:39,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:39,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:39,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:39,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:40,682 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:40,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:40,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 12:22:40,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 12:22:40,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 12:22:40,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:22:40,683 INFO L87 Difference]: Start difference. First operand 5650 states and 8202 transitions. Second operand 24 states. [2019-09-08 12:22:41,812 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 12:22:42,061 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 12:22:42,380 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 12:22:42,824 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-09-08 12:22:43,512 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-09-08 12:22:43,744 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 12:22:43,966 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 12:22:44,190 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-08 12:22:44,383 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 12:22:44,601 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-08 12:22:44,921 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 12:22:45,344 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:22:45,595 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:22:45,968 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 12:23:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:00,101 INFO L93 Difference]: Finished difference Result 33300 states and 48686 transitions. [2019-09-08 12:23:00,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 12:23:00,102 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 110 [2019-09-08 12:23:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:00,130 INFO L225 Difference]: With dead ends: 33300 [2019-09-08 12:23:00,130 INFO L226 Difference]: Without dead ends: 31011 [2019-09-08 12:23:00,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=507, Invalid=2043, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:23:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31011 states. [2019-09-08 12:23:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31011 to 5615. [2019-09-08 12:23:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2019-09-08 12:23:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 8153 transitions. [2019-09-08 12:23:02,637 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 8153 transitions. Word has length 110 [2019-09-08 12:23:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:02,637 INFO L475 AbstractCegarLoop]: Abstraction has 5615 states and 8153 transitions. [2019-09-08 12:23:02,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 12:23:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 8153 transitions. [2019-09-08 12:23:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:23:02,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:02,638 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] [2019-09-08 12:23:02,638 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1456016802, now seen corresponding path program 1 times [2019-09-08 12:23:02,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:03,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:23:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 12:23:03,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 12:23:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 12:23:03,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:23:03,555 INFO L87 Difference]: Start difference. First operand 5615 states and 8153 transitions. Second operand 19 states. [2019-09-08 12:23:04,147 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-08 12:23:04,338 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:23:04,626 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 12:23:05,043 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-08 12:23:05,215 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:23:05,521 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:23:05,764 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:23:05,987 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:23:06,222 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:23:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:17,649 INFO L93 Difference]: Finished difference Result 27514 states and 40203 transitions. [2019-09-08 12:23:17,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:23:17,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2019-09-08 12:23:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:17,672 INFO L225 Difference]: With dead ends: 27514 [2019-09-08 12:23:17,673 INFO L226 Difference]: Without dead ends: 24730 [2019-09-08 12:23:17,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:23:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24730 states. [2019-09-08 12:23:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24730 to 5598. [2019-09-08 12:23:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-09-08 12:23:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 8126 transitions. [2019-09-08 12:23:20,216 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 8126 transitions. Word has length 110 [2019-09-08 12:23:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:20,217 INFO L475 AbstractCegarLoop]: Abstraction has 5598 states and 8126 transitions. [2019-09-08 12:23:20,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 12:23:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 8126 transitions. [2019-09-08 12:23:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:23:20,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:20,218 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] [2019-09-08 12:23:20,218 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:20,219 INFO L82 PathProgramCache]: Analyzing trace with hash 803810881, now seen corresponding path program 1 times [2019-09-08 12:23:20,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:20,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:20,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:20,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:20,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:21,056 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:21,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:21,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:23:21,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:23:21,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:23:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:23:21,058 INFO L87 Difference]: Start difference. First operand 5598 states and 8126 transitions. Second operand 16 states. [2019-09-08 12:23:21,251 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 12:23:21,622 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:23:21,855 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:23:22,128 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:23:22,362 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-08 12:23:22,696 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-09-08 12:23:23,026 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-08 12:23:23,366 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2019-09-08 12:23:23,544 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 12:23:23,719 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-08 12:23:24,032 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-08 12:23:24,273 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 12:23:24,571 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-09-08 12:23:24,778 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:23:27,476 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-08 12:23:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:40,835 INFO L93 Difference]: Finished difference Result 34462 states and 50356 transitions. [2019-09-08 12:23:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:23:40,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 110 [2019-09-08 12:23:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:40,865 INFO L225 Difference]: With dead ends: 34462 [2019-09-08 12:23:40,865 INFO L226 Difference]: Without dead ends: 32475 [2019-09-08 12:23:40,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:23:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32475 states. [2019-09-08 12:23:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32475 to 5576. [2019-09-08 12:23:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5576 states. [2019-09-08 12:23:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5576 states to 5576 states and 8094 transitions. [2019-09-08 12:23:43,789 INFO L78 Accepts]: Start accepts. Automaton has 5576 states and 8094 transitions. Word has length 110 [2019-09-08 12:23:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:43,790 INFO L475 AbstractCegarLoop]: Abstraction has 5576 states and 8094 transitions. [2019-09-08 12:23:43,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:23:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5576 states and 8094 transitions. [2019-09-08 12:23:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:23:43,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:43,791 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] [2019-09-08 12:23:43,791 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1603558044, now seen corresponding path program 1 times [2019-09-08 12:23:43,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:43,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:43,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:44,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:44,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:23:44,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:23:44,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:23:44,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:23:44,321 INFO L87 Difference]: Start difference. First operand 5576 states and 8094 transitions. Second operand 13 states. [2019-09-08 12:23:44,770 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-08 12:23:44,933 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:23:45,103 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 12:23:45,440 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 12:23:45,668 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:23:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:56,807 INFO L93 Difference]: Finished difference Result 24433 states and 35692 transitions. [2019-09-08 12:23:56,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:56,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-09-08 12:23:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:56,826 INFO L225 Difference]: With dead ends: 24433 [2019-09-08 12:23:56,826 INFO L226 Difference]: Without dead ends: 21681 [2019-09-08 12:23:56,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:23:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21681 states. [2019-09-08 12:23:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21681 to 5555. [2019-09-08 12:23:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5555 states. [2019-09-08 12:23:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 8063 transitions. [2019-09-08 12:23:59,725 INFO L78 Accepts]: Start accepts. Automaton has 5555 states and 8063 transitions. Word has length 110 [2019-09-08 12:23:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:59,725 INFO L475 AbstractCegarLoop]: Abstraction has 5555 states and 8063 transitions. [2019-09-08 12:23:59,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:23:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5555 states and 8063 transitions. [2019-09-08 12:23:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:23:59,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:59,726 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] [2019-09-08 12:23:59,726 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:59,727 INFO L82 PathProgramCache]: Analyzing trace with hash 751379724, now seen corresponding path program 1 times [2019-09-08 12:23:59,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:59,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:59,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:59,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:00,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:24:00,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:00,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:24:00,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:24:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:24:00,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:24:00,243 INFO L87 Difference]: Start difference. First operand 5555 states and 8063 transitions. Second operand 13 states. [2019-09-08 12:24:00,756 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-08 12:24:00,931 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:24:01,134 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-08 12:24:01,485 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-08 12:24:01,744 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-08 12:24:01,901 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:24:03,080 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 12:24:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:16,866 INFO L93 Difference]: Finished difference Result 29788 states and 43524 transitions. [2019-09-08 12:24:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:24:16,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2019-09-08 12:24:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:16,891 INFO L225 Difference]: With dead ends: 29788 [2019-09-08 12:24:16,891 INFO L226 Difference]: Without dead ends: 27011 [2019-09-08 12:24:16,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:24:16,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27011 states. [2019-09-08 12:24:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27011 to 5506. [2019-09-08 12:24:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-09-08 12:24:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 8004 transitions. [2019-09-08 12:24:20,067 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 8004 transitions. Word has length 111 [2019-09-08 12:24:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:20,068 INFO L475 AbstractCegarLoop]: Abstraction has 5506 states and 8004 transitions. [2019-09-08 12:24:20,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:24:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 8004 transitions. [2019-09-08 12:24:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:24:20,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:20,068 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] [2019-09-08 12:24:20,069 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:20,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:20,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1526289660, now seen corresponding path program 1 times [2019-09-08 12:24:20,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:20,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:20,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:20,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:20,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:20,955 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:20,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:20,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 12:24:20,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:24:20,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:24:20,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:24:20,957 INFO L87 Difference]: Start difference. First operand 5506 states and 8004 transitions. Second operand 18 states. [2019-09-08 12:24:21,384 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-08 12:24:21,522 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-09-08 12:24:21,965 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:24:22,193 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 12:24:22,476 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-09-08 12:24:22,696 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 12:24:22,915 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 12:24:23,129 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 12:24:23,333 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-08 12:24:23,519 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-08 12:24:23,695 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-08 12:24:23,848 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 12:24:24,062 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 12:24:24,361 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:24:24,709 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:24:24,915 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:24:25,165 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 12:24:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:43,543 INFO L93 Difference]: Finished difference Result 31699 states and 46408 transitions. [2019-09-08 12:24:43,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:24:43,543 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2019-09-08 12:24:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:43,571 INFO L225 Difference]: With dead ends: 31699 [2019-09-08 12:24:43,571 INFO L226 Difference]: Without dead ends: 30068 [2019-09-08 12:24:43,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=359, Invalid=1281, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:24:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30068 states. [2019-09-08 12:24:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30068 to 5505. [2019-09-08 12:24:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5505 states. [2019-09-08 12:24:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5505 states to 5505 states and 8002 transitions. [2019-09-08 12:24:46,951 INFO L78 Accepts]: Start accepts. Automaton has 5505 states and 8002 transitions. Word has length 111 [2019-09-08 12:24:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:46,951 INFO L475 AbstractCegarLoop]: Abstraction has 5505 states and 8002 transitions. [2019-09-08 12:24:46,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 12:24:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5505 states and 8002 transitions. [2019-09-08 12:24:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:24:46,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:46,952 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] [2019-09-08 12:24:46,952 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1279540300, now seen corresponding path program 1 times [2019-09-08 12:24:46,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:46,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:47,420 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-09-08 12:24:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:47,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:47,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:24:47,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:24:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:24:47,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:24:47,621 INFO L87 Difference]: Start difference. First operand 5505 states and 8002 transitions. Second operand 12 states. [2019-09-08 12:24:47,892 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-08 12:24:48,040 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 12:24:48,194 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 12:24:48,322 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 12:24:48,474 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-08 12:24:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:59,869 INFO L93 Difference]: Finished difference Result 20285 states and 29695 transitions. [2019-09-08 12:24:59,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:24:59,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-08 12:24:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:59,884 INFO L225 Difference]: With dead ends: 20285 [2019-09-08 12:24:59,885 INFO L226 Difference]: Without dead ends: 17972 [2019-09-08 12:24:59,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:24:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17972 states. [2019-09-08 12:25:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17972 to 5352. [2019-09-08 12:25:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5352 states. [2019-09-08 12:25:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5352 states to 5352 states and 7788 transitions. [2019-09-08 12:25:03,279 INFO L78 Accepts]: Start accepts. Automaton has 5352 states and 7788 transitions. Word has length 111 [2019-09-08 12:25:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:03,279 INFO L475 AbstractCegarLoop]: Abstraction has 5352 states and 7788 transitions. [2019-09-08 12:25:03,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:25:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5352 states and 7788 transitions. [2019-09-08 12:25:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:25:03,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:03,283 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:25:03,283 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash -95034080, now seen corresponding path program 1 times [2019-09-08 12:25:03,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:03,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:03,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:03,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:03,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:03,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:03,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:03,350 INFO L87 Difference]: Start difference. First operand 5352 states and 7788 transitions. Second operand 3 states. [2019-09-08 12:25:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:09,846 INFO L93 Difference]: Finished difference Result 15468 states and 22514 transitions. [2019-09-08 12:25:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:09,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:25:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:09,858 INFO L225 Difference]: With dead ends: 15468 [2019-09-08 12:25:09,858 INFO L226 Difference]: Without dead ends: 10250 [2019-09-08 12:25:09,862 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:25:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2019-09-08 12:25:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 9928. [2019-09-08 12:25:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9928 states. [2019-09-08 12:25:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 14390 transitions. [2019-09-08 12:25:16,094 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 14390 transitions. Word has length 142 [2019-09-08 12:25:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:16,095 INFO L475 AbstractCegarLoop]: Abstraction has 9928 states and 14390 transitions. [2019-09-08 12:25:16,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 14390 transitions. [2019-09-08 12:25:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 12:25:16,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:16,097 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:25:16,097 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:16,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1750292162, now seen corresponding path program 1 times [2019-09-08 12:25:16,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:16,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:16,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:16,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:16,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:16,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:16,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:16,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:16,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:16,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:16,164 INFO L87 Difference]: Start difference. First operand 9928 states and 14390 transitions. Second operand 3 states. [2019-09-08 12:25:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:28,705 INFO L93 Difference]: Finished difference Result 28876 states and 41760 transitions. [2019-09-08 12:25:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:25:28,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 12:25:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:28,724 INFO L225 Difference]: With dead ends: 28876 [2019-09-08 12:25:28,724 INFO L226 Difference]: Without dead ends: 19082 [2019-09-08 12:25:28,732 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:25:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19082 states. [2019-09-08 12:25:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19082 to 18440. [2019-09-08 12:25:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18440 states. [2019-09-08 12:25:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18440 states to 18440 states and 26554 transitions. [2019-09-08 12:25:40,616 INFO L78 Accepts]: Start accepts. Automaton has 18440 states and 26554 transitions. Word has length 143 [2019-09-08 12:25:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:40,617 INFO L475 AbstractCegarLoop]: Abstraction has 18440 states and 26554 transitions. [2019-09-08 12:25:40,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:25:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18440 states and 26554 transitions. [2019-09-08 12:25:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:25:40,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:40,619 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:25:40,619 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 537810685, now seen corresponding path program 1 times [2019-09-08 12:25:40,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:40,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:40,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:40,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:40,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:40,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:25:40,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:25:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:25:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:25:40,691 INFO L87 Difference]: Start difference. First operand 18440 states and 26554 transitions. Second operand 3 states. [2019-09-08 12:26:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:04,723 INFO L93 Difference]: Finished difference Result 53772 states and 77132 transitions. [2019-09-08 12:26:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:26:04,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:26:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:04,757 INFO L225 Difference]: With dead ends: 53772 [2019-09-08 12:26:04,757 INFO L226 Difference]: Without dead ends: 35466 [2019-09-08 12:26:04,777 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:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35466 states. [2019-09-08 12:26:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35466 to 34184. [2019-09-08 12:26:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34184 states. [2019-09-08 12:26:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34184 states to 34184 states and 48802 transitions. [2019-09-08 12:26:26,629 INFO L78 Accepts]: Start accepts. Automaton has 34184 states and 48802 transitions. Word has length 144 [2019-09-08 12:26:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:26,629 INFO L475 AbstractCegarLoop]: Abstraction has 34184 states and 48802 transitions. [2019-09-08 12:26:26,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:26:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34184 states and 48802 transitions. [2019-09-08 12:26:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 12:26:26,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:26,631 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:26:26,631 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash 897083338, now seen corresponding path program 1 times [2019-09-08 12:26:26,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:26,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:26,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:26,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:26,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:26:26,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:26:26,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:26:26,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:26:26,696 INFO L87 Difference]: Start difference. First operand 34184 states and 48802 transitions. Second operand 3 states. [2019-09-08 12:27:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:09,966 INFO L93 Difference]: Finished difference Result 99724 states and 141636 transitions. [2019-09-08 12:27:09,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:27:09,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-08 12:27:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:10,040 INFO L225 Difference]: With dead ends: 99724 [2019-09-08 12:27:10,041 INFO L226 Difference]: Without dead ends: 65674 [2019-09-08 12:27:10,072 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:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65674 states. [2019-09-08 12:27:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65674 to 63112. [2019-09-08 12:27:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63112 states. [2019-09-08 12:27:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63112 states to 63112 states and 89138 transitions. [2019-09-08 12:27:52,451 INFO L78 Accepts]: Start accepts. Automaton has 63112 states and 89138 transitions. Word has length 145 [2019-09-08 12:27:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:52,451 INFO L475 AbstractCegarLoop]: Abstraction has 63112 states and 89138 transitions. [2019-09-08 12:27:52,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:27:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 63112 states and 89138 transitions. [2019-09-08 12:27:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:27:52,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:52,452 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:27:52,453 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:52,453 INFO L82 PathProgramCache]: Analyzing trace with hash 691630939, now seen corresponding path program 1 times [2019-09-08 12:27:52,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:52,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:52,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:52,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:27:52,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:27:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:27:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:27:52,536 INFO L87 Difference]: Start difference. First operand 63112 states and 89138 transitions. Second operand 3 states. [2019-09-08 12:28:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:52,617 INFO L93 Difference]: Finished difference Result 133766 states and 189283 transitions. [2019-09-08 12:28:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:52,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:28:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:52,704 INFO L225 Difference]: With dead ends: 133766 [2019-09-08 12:28:52,704 INFO L226 Difference]: Without dead ends: 88932 [2019-09-08 12:28:52,737 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:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88932 states. [2019-09-08 12:29:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88932 to 85466. [2019-09-08 12:29:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85466 states. [2019-09-08 12:29:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85466 states to 85466 states and 119972 transitions. [2019-09-08 12:29:50,857 INFO L78 Accepts]: Start accepts. Automaton has 85466 states and 119972 transitions. Word has length 146 [2019-09-08 12:29:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:50,857 INFO L475 AbstractCegarLoop]: Abstraction has 85466 states and 119972 transitions. [2019-09-08 12:29:50,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 85466 states and 119972 transitions. [2019-09-08 12:29:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:29:50,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:50,859 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,859 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1503921644, now seen corresponding path program 1 times [2019-09-08 12:29:50,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:50,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:50,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:50,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:50,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:29:50,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:29:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:29:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:29:50,967 INFO L87 Difference]: Start difference. First operand 85466 states and 119972 transitions. Second operand 7 states.