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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:05:46,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:05:46,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:05:46,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:05:46,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:05:46,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:05:46,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:05:46,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:05:46,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:05:46,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:05:46,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:05:46,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:05:46,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:05:46,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:05:46,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:05:46,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:05:46,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:05:46,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:05:46,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:05:46,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:05:46,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:05:46,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:05:46,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:05:46,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:05:46,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:05:46,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:05:46,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:05:46,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:05:46,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:05:46,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:05:46,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:05:46,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:05:46,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:05:46,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:05:46,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:05:46,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:05:46,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:05:46,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:05:46,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:05:46,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:05:46,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:05:46,112 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 13:05:46,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:05:46,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:05:46,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:05:46,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:05:46,129 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:05:46,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:05:46,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:05:46,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:05:46,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:05:46,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:05:46,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:05:46,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:05:46,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:05:46,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:05:46,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:05:46,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:05:46,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:05:46,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:05:46,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:05:46,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:05:46,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:05:46,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:05:46,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:05:46,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:05:46,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:05:46,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:05:46,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:05:46,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:05:46,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:05:46,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:05:46,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:05:46,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:05:46,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:05:46,197 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:05:46,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 13:05:46,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59026e657/fea6db62222848f9a4465d63e2c2a4bc/FLAGb693378e8 [2019-09-08 13:05:46,859 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:05:46,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 13:05:46,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59026e657/fea6db62222848f9a4465d63e2c2a4bc/FLAGb693378e8 [2019-09-08 13:05:47,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59026e657/fea6db62222848f9a4465d63e2c2a4bc [2019-09-08 13:05:47,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:05:47,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:05:47,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:05:47,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:05:47,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:05:47,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:05:47" (1/1) ... [2019-09-08 13:05:47,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1332b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:47, skipping insertion in model container [2019-09-08 13:05:47,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:05:47" (1/1) ... [2019-09-08 13:05:47,104 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:05:47,185 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:05:47,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:05:47,733 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:05:48,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:05:48,238 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:05:48,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48 WrapperNode [2019-09-08 13:05:48,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:05:48,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:05:48,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:05:48,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:05:48,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (1/1) ... [2019-09-08 13:05:48,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (1/1) ... [2019-09-08 13:05:48,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (1/1) ... [2019-09-08 13:05:48,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (1/1) ... [2019-09-08 13:05:48,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (1/1) ... [2019-09-08 13:05:48,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (1/1) ... [2019-09-08 13:05:48,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (1/1) ... [2019-09-08 13:05:48,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:05:48,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:05:48,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:05:48,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:05:48,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (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 13:05:48,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:05:48,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:05:48,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:05:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:05:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:05:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:05:48,455 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:05:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:05:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:05:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:05:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:05:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:05:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:05:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:05:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:05:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:05:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:05:48,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:05:49,980 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:05:49,981 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:05:49,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:05:49 BoogieIcfgContainer [2019-09-08 13:05:49,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:05:49,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:05:49,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:05:49,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:05:49,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:05:47" (1/3) ... [2019-09-08 13:05:49,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd20c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:05:49, skipping insertion in model container [2019-09-08 13:05:49,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:05:48" (2/3) ... [2019-09-08 13:05:49,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd20c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:05:49, skipping insertion in model container [2019-09-08 13:05:49,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:05:49" (3/3) ... [2019-09-08 13:05:49,999 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 13:05:50,011 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:05:50,035 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:05:50,054 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:05:50,099 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:05:50,100 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:05:50,100 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:05:50,101 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:05:50,101 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:05:50,101 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:05:50,101 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:05:50,101 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:05:50,101 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:05:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2019-09-08 13:05:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 13:05:50,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:50,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:50,152 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash 424996304, now seen corresponding path program 1 times [2019-09-08 13:05:50,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:50,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:50,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:50,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:50,894 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 13:05:50,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:50,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:50,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:50,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:50,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:50,924 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 3 states. [2019-09-08 13:05:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:51,158 INFO L93 Difference]: Finished difference Result 655 states and 1134 transitions. [2019-09-08 13:05:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:51,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-08 13:05:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:51,190 INFO L225 Difference]: With dead ends: 655 [2019-09-08 13:05:51,190 INFO L226 Difference]: Without dead ends: 540 [2019-09-08 13:05:51,197 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 13:05:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-08 13:05:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-09-08 13:05:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-09-08 13:05:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2019-09-08 13:05:51,298 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 157 [2019-09-08 13:05:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:51,299 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2019-09-08 13:05:51,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2019-09-08 13:05:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 13:05:51,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:51,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:51,305 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1469457116, now seen corresponding path program 1 times [2019-09-08 13:05:51,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:51,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:51,766 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 13:05:51,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:51,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:51,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:51,769 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand 4 states. [2019-09-08 13:05:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:51,907 INFO L93 Difference]: Finished difference Result 1561 states and 2326 transitions. [2019-09-08 13:05:51,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:51,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-08 13:05:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:51,914 INFO L225 Difference]: With dead ends: 1561 [2019-09-08 13:05:51,914 INFO L226 Difference]: Without dead ends: 1036 [2019-09-08 13:05:51,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-08 13:05:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2019-09-08 13:05:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-09-08 13:05:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2019-09-08 13:05:51,981 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 157 [2019-09-08 13:05:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:51,982 INFO L475 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2019-09-08 13:05:51,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2019-09-08 13:05:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 13:05:51,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:51,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:51,997 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash -790671312, now seen corresponding path program 1 times [2019-09-08 13:05:51,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:51,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:52,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:52,148 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 13:05:52,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:52,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:52,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:52,150 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand 3 states. [2019-09-08 13:05:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:52,242 INFO L93 Difference]: Finished difference Result 3056 states and 4517 transitions. [2019-09-08 13:05:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:52,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 13:05:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:52,259 INFO L225 Difference]: With dead ends: 3056 [2019-09-08 13:05:52,259 INFO L226 Difference]: Without dead ends: 2054 [2019-09-08 13:05:52,262 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 13:05:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-09-08 13:05:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1036. [2019-09-08 13:05:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-08 13:05:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1531 transitions. [2019-09-08 13:05:52,350 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1531 transitions. Word has length 158 [2019-09-08 13:05:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:52,350 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1531 transitions. [2019-09-08 13:05:52,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1531 transitions. [2019-09-08 13:05:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:05:52,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:52,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:52,354 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:52,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1966932605, now seen corresponding path program 1 times [2019-09-08 13:05:52,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:52,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:52,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:52,618 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 13:05:52,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:52,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:52,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:52,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:52,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:52,646 INFO L87 Difference]: Start difference. First operand 1036 states and 1531 transitions. Second operand 4 states. [2019-09-08 13:05:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:52,737 INFO L93 Difference]: Finished difference Result 2058 states and 3044 transitions. [2019-09-08 13:05:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:52,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-08 13:05:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:52,745 INFO L225 Difference]: With dead ends: 2058 [2019-09-08 13:05:52,745 INFO L226 Difference]: Without dead ends: 1034 [2019-09-08 13:05:52,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-08 13:05:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2019-09-08 13:05:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-09-08 13:05:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1527 transitions. [2019-09-08 13:05:52,814 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1527 transitions. Word has length 159 [2019-09-08 13:05:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:52,814 INFO L475 AbstractCegarLoop]: Abstraction has 1034 states and 1527 transitions. [2019-09-08 13:05:52,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1527 transitions. [2019-09-08 13:05:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:05:52,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:52,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:52,818 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash 745680526, now seen corresponding path program 1 times [2019-09-08 13:05:52,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:52,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:52,966 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 13:05:52,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:52,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:52,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:52,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:52,968 INFO L87 Difference]: Start difference. First operand 1034 states and 1527 transitions. Second operand 3 states. [2019-09-08 13:05:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:53,121 INFO L93 Difference]: Finished difference Result 2367 states and 3510 transitions. [2019-09-08 13:05:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:53,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 13:05:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:53,135 INFO L225 Difference]: With dead ends: 2367 [2019-09-08 13:05:53,136 INFO L226 Difference]: Without dead ends: 1530 [2019-09-08 13:05:53,139 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 13:05:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2019-09-08 13:05:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1528. [2019-09-08 13:05:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-09-08 13:05:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2231 transitions. [2019-09-08 13:05:53,250 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2231 transitions. Word has length 159 [2019-09-08 13:05:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:53,251 INFO L475 AbstractCegarLoop]: Abstraction has 1528 states and 2231 transitions. [2019-09-08 13:05:53,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2231 transitions. [2019-09-08 13:05:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:05:53,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:53,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:53,257 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash -51426036, now seen corresponding path program 1 times [2019-09-08 13:05:53,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:53,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:53,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:53,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:53,381 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 13:05:53,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:53,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:53,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:53,383 INFO L87 Difference]: Start difference. First operand 1528 states and 2231 transitions. Second operand 3 states. [2019-09-08 13:05:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:53,605 INFO L93 Difference]: Finished difference Result 3607 states and 5378 transitions. [2019-09-08 13:05:53,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:53,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 13:05:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:53,617 INFO L225 Difference]: With dead ends: 3607 [2019-09-08 13:05:53,617 INFO L226 Difference]: Without dead ends: 2268 [2019-09-08 13:05:53,623 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 13:05:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-09-08 13:05:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1952. [2019-09-08 13:05:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-08 13:05:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2919 transitions. [2019-09-08 13:05:53,763 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2919 transitions. Word has length 161 [2019-09-08 13:05:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:53,764 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 2919 transitions. [2019-09-08 13:05:53,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2919 transitions. [2019-09-08 13:05:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 13:05:53,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:53,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:53,769 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash -541662678, now seen corresponding path program 1 times [2019-09-08 13:05:53,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:53,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:53,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:53,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:53,894 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 13:05:53,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:53,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:53,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:53,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:53,897 INFO L87 Difference]: Start difference. First operand 1952 states and 2919 transitions. Second operand 3 states. [2019-09-08 13:05:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:54,119 INFO L93 Difference]: Finished difference Result 4665 states and 7124 transitions. [2019-09-08 13:05:54,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:54,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 13:05:54,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:54,137 INFO L225 Difference]: With dead ends: 4665 [2019-09-08 13:05:54,137 INFO L226 Difference]: Without dead ends: 2986 [2019-09-08 13:05:54,142 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 13:05:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-09-08 13:05:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2706. [2019-09-08 13:05:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-09-08 13:05:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4140 transitions. [2019-09-08 13:05:54,387 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4140 transitions. Word has length 163 [2019-09-08 13:05:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:54,388 INFO L475 AbstractCegarLoop]: Abstraction has 2706 states and 4140 transitions. [2019-09-08 13:05:54,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4140 transitions. [2019-09-08 13:05:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 13:05:54,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:54,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:54,393 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:54,394 INFO L82 PathProgramCache]: Analyzing trace with hash 911873176, now seen corresponding path program 1 times [2019-09-08 13:05:54,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:54,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:54,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:54,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:54,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:54,597 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 13:05:54,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:54,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:05:54,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:05:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:05:54,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:54,599 INFO L87 Difference]: Start difference. First operand 2706 states and 4140 transitions. Second operand 5 states. [2019-09-08 13:05:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:55,225 INFO L93 Difference]: Finished difference Result 7601 states and 11757 transitions. [2019-09-08 13:05:55,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:05:55,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-09-08 13:05:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:55,252 INFO L225 Difference]: With dead ends: 7601 [2019-09-08 13:05:55,252 INFO L226 Difference]: Without dead ends: 5078 [2019-09-08 13:05:55,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:05:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-09-08 13:05:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5076. [2019-09-08 13:05:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-09-08 13:05:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7794 transitions. [2019-09-08 13:05:55,723 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7794 transitions. Word has length 164 [2019-09-08 13:05:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:55,724 INFO L475 AbstractCegarLoop]: Abstraction has 5076 states and 7794 transitions. [2019-09-08 13:05:55,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:05:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7794 transitions. [2019-09-08 13:05:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 13:05:55,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:55,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:55,732 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:55,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2112908957, now seen corresponding path program 1 times [2019-09-08 13:05:55,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:55,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:55,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:55,994 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 13:05:55,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:55,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:55,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:55,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:55,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:55,996 INFO L87 Difference]: Start difference. First operand 5076 states and 7794 transitions. Second operand 4 states. [2019-09-08 13:05:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:56,579 INFO L93 Difference]: Finished difference Result 13247 states and 20350 transitions. [2019-09-08 13:05:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:05:56,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 13:05:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:56,632 INFO L225 Difference]: With dead ends: 13247 [2019-09-08 13:05:56,633 INFO L226 Difference]: Without dead ends: 8194 [2019-09-08 13:05:56,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:05:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-09-08 13:05:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8192. [2019-09-08 13:05:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-09-08 13:05:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12472 transitions. [2019-09-08 13:05:57,244 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12472 transitions. Word has length 164 [2019-09-08 13:05:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:57,244 INFO L475 AbstractCegarLoop]: Abstraction has 8192 states and 12472 transitions. [2019-09-08 13:05:57,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:05:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12472 transitions. [2019-09-08 13:05:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:05:57,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:57,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:57,254 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1008257189, now seen corresponding path program 1 times [2019-09-08 13:05:57,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:57,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:57,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:57,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:05:57,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:05:57,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:05:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:05:57,461 INFO L87 Difference]: Start difference. First operand 8192 states and 12472 transitions. Second operand 3 states. [2019-09-08 13:05:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:05:58,222 INFO L93 Difference]: Finished difference Result 22090 states and 33656 transitions. [2019-09-08 13:05:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:05:58,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 13:05:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:05:58,257 INFO L225 Difference]: With dead ends: 22090 [2019-09-08 13:05:58,258 INFO L226 Difference]: Without dead ends: 14274 [2019-09-08 13:05:58,274 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 13:05:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14274 states. [2019-09-08 13:05:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14274 to 14272. [2019-09-08 13:05:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14272 states. [2019-09-08 13:05:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14272 states to 14272 states and 21484 transitions. [2019-09-08 13:05:59,764 INFO L78 Accepts]: Start accepts. Automaton has 14272 states and 21484 transitions. Word has length 166 [2019-09-08 13:05:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:59,764 INFO L475 AbstractCegarLoop]: Abstraction has 14272 states and 21484 transitions. [2019-09-08 13:05:59,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 14272 states and 21484 transitions. [2019-09-08 13:05:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:05:59,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:59,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:05:59,777 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash 332205762, now seen corresponding path program 1 times [2019-09-08 13:05:59,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:59,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:59,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:59,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:05:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:05:59,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:05:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:05:59,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:05:59,965 INFO L87 Difference]: Start difference. First operand 14272 states and 21484 transitions. Second operand 4 states. [2019-09-08 13:06:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:00,644 INFO L93 Difference]: Finished difference Result 23660 states and 35647 transitions. [2019-09-08 13:06:00,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:00,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 13:06:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:00,686 INFO L225 Difference]: With dead ends: 23660 [2019-09-08 13:06:00,686 INFO L226 Difference]: Without dead ends: 12737 [2019-09-08 13:06:00,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12737 states. [2019-09-08 13:06:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12737 to 12737. [2019-09-08 13:06:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-09-08 13:06:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 19158 transitions. [2019-09-08 13:06:01,438 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 19158 transitions. Word has length 166 [2019-09-08 13:06:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:01,438 INFO L475 AbstractCegarLoop]: Abstraction has 12737 states and 19158 transitions. [2019-09-08 13:06:01,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 19158 transitions. [2019-09-08 13:06:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 13:06:01,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:01,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:01,455 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1356015054, now seen corresponding path program 1 times [2019-09-08 13:06:01,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:01,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:01,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:01,550 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 13:06:01,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:01,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:01,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:01,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:01,552 INFO L87 Difference]: Start difference. First operand 12737 states and 19158 transitions. Second operand 3 states. [2019-09-08 13:06:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:02,713 INFO L93 Difference]: Finished difference Result 33839 states and 51503 transitions. [2019-09-08 13:06:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:02,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 13:06:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:02,772 INFO L225 Difference]: With dead ends: 33839 [2019-09-08 13:06:02,772 INFO L226 Difference]: Without dead ends: 21443 [2019-09-08 13:06:02,798 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 13:06:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21443 states. [2019-09-08 13:06:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21443 to 19533. [2019-09-08 13:06:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-09-08 13:06:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 29933 transitions. [2019-09-08 13:06:03,769 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 29933 transitions. Word has length 170 [2019-09-08 13:06:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:03,769 INFO L475 AbstractCegarLoop]: Abstraction has 19533 states and 29933 transitions. [2019-09-08 13:06:03,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 29933 transitions. [2019-09-08 13:06:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 13:06:03,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:03,782 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:03,783 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash -927051742, now seen corresponding path program 1 times [2019-09-08 13:06:03,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:03,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:03,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:03,992 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 13:06:03,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:03,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:06:03,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:06:03,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:06:03,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:06:03,994 INFO L87 Difference]: Start difference. First operand 19533 states and 29933 transitions. Second operand 8 states. [2019-09-08 13:06:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:07,769 INFO L93 Difference]: Finished difference Result 80177 states and 123376 transitions. [2019-09-08 13:06:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:06:07,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2019-09-08 13:06:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:07,927 INFO L225 Difference]: With dead ends: 80177 [2019-09-08 13:06:07,927 INFO L226 Difference]: Without dead ends: 61059 [2019-09-08 13:06:07,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:06:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61059 states. [2019-09-08 13:06:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61059 to 32625. [2019-09-08 13:06:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32625 states. [2019-09-08 13:06:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32625 states to 32625 states and 49361 transitions. [2019-09-08 13:06:10,076 INFO L78 Accepts]: Start accepts. Automaton has 32625 states and 49361 transitions. Word has length 171 [2019-09-08 13:06:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:10,076 INFO L475 AbstractCegarLoop]: Abstraction has 32625 states and 49361 transitions. [2019-09-08 13:06:10,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:06:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 32625 states and 49361 transitions. [2019-09-08 13:06:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 13:06:10,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:10,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:10,089 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash 299202232, now seen corresponding path program 1 times [2019-09-08 13:06:10,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:10,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:10,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:10,278 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 13:06:10,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:10,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:10,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:10,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:10,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:10,280 INFO L87 Difference]: Start difference. First operand 32625 states and 49361 transitions. Second operand 4 states. [2019-09-08 13:06:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:13,634 INFO L93 Difference]: Finished difference Result 90603 states and 136692 transitions. [2019-09-08 13:06:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:13,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-08 13:06:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:13,833 INFO L225 Difference]: With dead ends: 90603 [2019-09-08 13:06:13,834 INFO L226 Difference]: Without dead ends: 58021 [2019-09-08 13:06:13,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58021 states. [2019-09-08 13:06:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58021 to 58019. [2019-09-08 13:06:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58019 states. [2019-09-08 13:06:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58019 states to 58019 states and 86398 transitions. [2019-09-08 13:06:17,008 INFO L78 Accepts]: Start accepts. Automaton has 58019 states and 86398 transitions. Word has length 171 [2019-09-08 13:06:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:17,008 INFO L475 AbstractCegarLoop]: Abstraction has 58019 states and 86398 transitions. [2019-09-08 13:06:17,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 58019 states and 86398 transitions. [2019-09-08 13:06:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 13:06:17,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:17,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:17,030 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:17,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash -996193854, now seen corresponding path program 1 times [2019-09-08 13:06:17,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:17,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:17,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:17,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:17,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:17,102 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 13:06:17,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:17,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:17,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:17,104 INFO L87 Difference]: Start difference. First operand 58019 states and 86398 transitions. Second operand 3 states. [2019-09-08 13:06:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:23,789 INFO L93 Difference]: Finished difference Result 173855 states and 258937 transitions. [2019-09-08 13:06:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:23,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 13:06:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:23,967 INFO L225 Difference]: With dead ends: 173855 [2019-09-08 13:06:23,967 INFO L226 Difference]: Without dead ends: 115946 [2019-09-08 13:06:24,043 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 13:06:24,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115946 states. [2019-09-08 13:06:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115946 to 58025. [2019-09-08 13:06:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58025 states. [2019-09-08 13:06:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58025 states to 58025 states and 86404 transitions. [2019-09-08 13:06:27,654 INFO L78 Accepts]: Start accepts. Automaton has 58025 states and 86404 transitions. Word has length 172 [2019-09-08 13:06:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:27,654 INFO L475 AbstractCegarLoop]: Abstraction has 58025 states and 86404 transitions. [2019-09-08 13:06:27,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 58025 states and 86404 transitions. [2019-09-08 13:06:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:06:27,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:27,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:27,668 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:27,668 INFO L82 PathProgramCache]: Analyzing trace with hash -991150146, now seen corresponding path program 1 times [2019-09-08 13:06:27,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:27,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:27,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:27,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:27,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:27,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:27,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:06:27,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:06:27,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:06:27,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:06:27,777 INFO L87 Difference]: Start difference. First operand 58025 states and 86404 transitions. Second operand 3 states. [2019-09-08 13:06:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:34,361 INFO L93 Difference]: Finished difference Result 152523 states and 226729 transitions. [2019-09-08 13:06:34,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:06:34,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 13:06:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:34,494 INFO L225 Difference]: With dead ends: 152523 [2019-09-08 13:06:34,494 INFO L226 Difference]: Without dead ends: 95257 [2019-09-08 13:06:34,548 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 13:06:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95257 states. [2019-09-08 13:06:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95257 to 95255. [2019-09-08 13:06:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95255 states. [2019-09-08 13:06:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95255 states to 95255 states and 139927 transitions. [2019-09-08 13:06:39,936 INFO L78 Accepts]: Start accepts. Automaton has 95255 states and 139927 transitions. Word has length 173 [2019-09-08 13:06:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:39,936 INFO L475 AbstractCegarLoop]: Abstraction has 95255 states and 139927 transitions. [2019-09-08 13:06:39,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:06:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 95255 states and 139927 transitions. [2019-09-08 13:06:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:06:39,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:39,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:39,959 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1114653633, now seen corresponding path program 1 times [2019-09-08 13:06:39,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:39,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:39,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:06:40,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:40,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:40,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:40,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:40,112 INFO L87 Difference]: Start difference. First operand 95255 states and 139927 transitions. Second operand 4 states. [2019-09-08 13:06:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:46,342 INFO L93 Difference]: Finished difference Result 179227 states and 263486 transitions. [2019-09-08 13:06:46,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:06:46,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 13:06:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:46,463 INFO L225 Difference]: With dead ends: 179227 [2019-09-08 13:06:46,464 INFO L226 Difference]: Without dead ends: 84655 [2019-09-08 13:06:46,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84655 states. [2019-09-08 13:06:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84655 to 84655. [2019-09-08 13:06:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84655 states. [2019-09-08 13:06:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84655 states to 84655 states and 124346 transitions. [2019-09-08 13:06:51,477 INFO L78 Accepts]: Start accepts. Automaton has 84655 states and 124346 transitions. Word has length 173 [2019-09-08 13:06:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:06:51,478 INFO L475 AbstractCegarLoop]: Abstraction has 84655 states and 124346 transitions. [2019-09-08 13:06:51,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:06:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 84655 states and 124346 transitions. [2019-09-08 13:06:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:06:51,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:06:51,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:06:51,493 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:06:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:06:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1296649650, now seen corresponding path program 1 times [2019-09-08 13:06:51,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:06:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:06:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:06:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:06:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:06:51,611 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 13:06:51,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:06:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:06:51,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:06:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:06:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:06:51,613 INFO L87 Difference]: Start difference. First operand 84655 states and 124346 transitions. Second operand 4 states. [2019-09-08 13:07:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:01,915 INFO L93 Difference]: Finished difference Result 229885 states and 343768 transitions. [2019-09-08 13:07:01,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:01,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-08 13:07:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:02,146 INFO L225 Difference]: With dead ends: 229885 [2019-09-08 13:07:02,147 INFO L226 Difference]: Without dead ends: 154615 [2019-09-08 13:07:02,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154615 states. [2019-09-08 13:07:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154615 to 83121. [2019-09-08 13:07:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83121 states. [2019-09-08 13:07:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83121 states to 83121 states and 122384 transitions. [2019-09-08 13:07:07,891 INFO L78 Accepts]: Start accepts. Automaton has 83121 states and 122384 transitions. Word has length 178 [2019-09-08 13:07:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:07,891 INFO L475 AbstractCegarLoop]: Abstraction has 83121 states and 122384 transitions. [2019-09-08 13:07:07,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 83121 states and 122384 transitions. [2019-09-08 13:07:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:07:07,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:07,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:07,906 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1810459694, now seen corresponding path program 1 times [2019-09-08 13:07:07,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:08,118 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 13:07:08,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:08,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:08,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:08,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:08,120 INFO L87 Difference]: Start difference. First operand 83121 states and 122384 transitions. Second operand 4 states. [2019-09-08 13:07:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:12,899 INFO L93 Difference]: Finished difference Result 158679 states and 233670 transitions. [2019-09-08 13:07:12,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:12,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-08 13:07:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:13,011 INFO L225 Difference]: With dead ends: 158679 [2019-09-08 13:07:13,011 INFO L226 Difference]: Without dead ends: 75852 [2019-09-08 13:07:13,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75852 states. [2019-09-08 13:07:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75852 to 75810. [2019-09-08 13:07:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75810 states. [2019-09-08 13:07:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75810 states to 75810 states and 111569 transitions. [2019-09-08 13:07:20,412 INFO L78 Accepts]: Start accepts. Automaton has 75810 states and 111569 transitions. Word has length 178 [2019-09-08 13:07:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:20,412 INFO L475 AbstractCegarLoop]: Abstraction has 75810 states and 111569 transitions. [2019-09-08 13:07:20,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75810 states and 111569 transitions. [2019-09-08 13:07:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:07:20,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:20,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:20,426 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash -398440038, now seen corresponding path program 1 times [2019-09-08 13:07:20,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:20,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:20,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:20,647 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 13:07:20,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:20,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:20,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:20,649 INFO L87 Difference]: Start difference. First operand 75810 states and 111569 transitions. Second operand 4 states. [2019-09-08 13:07:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:25,614 INFO L93 Difference]: Finished difference Result 151624 states and 223144 transitions. [2019-09-08 13:07:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:25,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-08 13:07:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:25,720 INFO L225 Difference]: With dead ends: 151624 [2019-09-08 13:07:25,721 INFO L226 Difference]: Without dead ends: 75975 [2019-09-08 13:07:25,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75975 states. [2019-09-08 13:07:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75975 to 75913. [2019-09-08 13:07:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75913 states. [2019-09-08 13:07:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75913 states to 75913 states and 111673 transitions. [2019-09-08 13:07:32,845 INFO L78 Accepts]: Start accepts. Automaton has 75913 states and 111673 transitions. Word has length 180 [2019-09-08 13:07:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:32,845 INFO L475 AbstractCegarLoop]: Abstraction has 75913 states and 111673 transitions. [2019-09-08 13:07:32,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 75913 states and 111673 transitions. [2019-09-08 13:07:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:07:32,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:32,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:32,862 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash 226188346, now seen corresponding path program 1 times [2019-09-08 13:07:32,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:32,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:32,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:32,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 13:07:32,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:32,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:32,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:32,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:32,927 INFO L87 Difference]: Start difference. First operand 75913 states and 111673 transitions. Second operand 3 states. [2019-09-08 13:07:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:42,238 INFO L93 Difference]: Finished difference Result 209441 states and 308204 transitions. [2019-09-08 13:07:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:42,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 13:07:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:42,457 INFO L225 Difference]: With dead ends: 209441 [2019-09-08 13:07:42,458 INFO L226 Difference]: Without dead ends: 151612 [2019-09-08 13:07:42,521 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 13:07:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151612 states. [2019-09-08 13:07:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151612 to 75923. [2019-09-08 13:07:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75923 states. [2019-09-08 13:07:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75923 states to 75923 states and 111683 transitions. [2019-09-08 13:07:48,808 INFO L78 Accepts]: Start accepts. Automaton has 75923 states and 111683 transitions. Word has length 181 [2019-09-08 13:07:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:48,808 INFO L475 AbstractCegarLoop]: Abstraction has 75923 states and 111683 transitions. [2019-09-08 13:07:48,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 75923 states and 111683 transitions. [2019-09-08 13:07:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:07:48,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:48,820 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:48,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1394966811, now seen corresponding path program 1 times [2019-09-08 13:07:48,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:48,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:48,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:48,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:49,384 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 13:07:49,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:49,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:49,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:49,386 INFO L87 Difference]: Start difference. First operand 75923 states and 111683 transitions. Second operand 4 states. [2019-09-08 13:07:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:55,149 INFO L93 Difference]: Finished difference Result 134194 states and 197276 transitions. [2019-09-08 13:07:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:55,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-08 13:07:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:55,283 INFO L225 Difference]: With dead ends: 134194 [2019-09-08 13:07:55,284 INFO L226 Difference]: Without dead ends: 75913 [2019-09-08 13:07:55,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75913 states. [2019-09-08 13:08:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75913 to 75913. [2019-09-08 13:08:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75913 states. [2019-09-08 13:08:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75913 states to 75913 states and 111668 transitions. [2019-09-08 13:08:02,757 INFO L78 Accepts]: Start accepts. Automaton has 75913 states and 111668 transitions. Word has length 182 [2019-09-08 13:08:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:02,757 INFO L475 AbstractCegarLoop]: Abstraction has 75913 states and 111668 transitions. [2019-09-08 13:08:02,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 75913 states and 111668 transitions. [2019-09-08 13:08:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:08:02,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:02,771 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:02,771 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1207544264, now seen corresponding path program 1 times [2019-09-08 13:08:02,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:02,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:02,929 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 13:08:02,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:02,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:02,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:02,931 INFO L87 Difference]: Start difference. First operand 75913 states and 111668 transitions. Second operand 4 states. [2019-09-08 13:08:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:08,342 INFO L93 Difference]: Finished difference Result 145457 states and 213986 transitions. [2019-09-08 13:08:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:08,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-08 13:08:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:08,431 INFO L225 Difference]: With dead ends: 145457 [2019-09-08 13:08:08,432 INFO L226 Difference]: Without dead ends: 69809 [2019-09-08 13:08:08,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69809 states. [2019-09-08 13:08:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69809 to 69652. [2019-09-08 13:08:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69652 states. [2019-09-08 13:08:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69652 states to 69652 states and 102423 transitions. [2019-09-08 13:08:16,047 INFO L78 Accepts]: Start accepts. Automaton has 69652 states and 102423 transitions. Word has length 182 [2019-09-08 13:08:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:16,047 INFO L475 AbstractCegarLoop]: Abstraction has 69652 states and 102423 transitions. [2019-09-08 13:08:16,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 69652 states and 102423 transitions. [2019-09-08 13:08:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 13:08:16,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:16,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:16,057 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash -921357460, now seen corresponding path program 1 times [2019-09-08 13:08:16,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:16,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:16,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:16,169 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 13:08:16,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:16,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:16,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:16,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:16,171 INFO L87 Difference]: Start difference. First operand 69652 states and 102423 transitions. Second operand 4 states. [2019-09-08 13:08:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:25,497 INFO L93 Difference]: Finished difference Result 189897 states and 284071 transitions. [2019-09-08 13:08:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:25,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-08 13:08:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:25,734 INFO L225 Difference]: With dead ends: 189897 [2019-09-08 13:08:25,735 INFO L226 Difference]: Without dead ends: 128755 [2019-09-08 13:08:25,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128755 states. [2019-09-08 13:08:31,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128755 to 69595. [2019-09-08 13:08:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69595 states. [2019-09-08 13:08:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69595 states to 69595 states and 102282 transitions. [2019-09-08 13:08:31,974 INFO L78 Accepts]: Start accepts. Automaton has 69595 states and 102282 transitions. Word has length 184 [2019-09-08 13:08:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:31,975 INFO L475 AbstractCegarLoop]: Abstraction has 69595 states and 102282 transitions. [2019-09-08 13:08:31,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:08:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 69595 states and 102282 transitions. [2019-09-08 13:08:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 13:08:31,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:31,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:31,985 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash -275308307, now seen corresponding path program 1 times [2019-09-08 13:08:31,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:31,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:31,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:32,208 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 13:08:32,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:32,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:08:32,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:08:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:08:32,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:08:32,210 INFO L87 Difference]: Start difference. First operand 69595 states and 102282 transitions. Second operand 8 states. [2019-09-08 13:08:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:48,716 INFO L93 Difference]: Finished difference Result 221562 states and 327262 transitions. [2019-09-08 13:08:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:08:48,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-09-08 13:08:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:48,946 INFO L225 Difference]: With dead ends: 221562 [2019-09-08 13:08:48,947 INFO L226 Difference]: Without dead ends: 158832 [2019-09-08 13:08:49,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:08:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158832 states. [2019-09-08 13:08:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158832 to 77004. [2019-09-08 13:08:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77004 states. [2019-09-08 13:08:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77004 states to 77004 states and 113416 transitions. [2019-09-08 13:08:56,367 INFO L78 Accepts]: Start accepts. Automaton has 77004 states and 113416 transitions. Word has length 184 [2019-09-08 13:08:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:56,367 INFO L475 AbstractCegarLoop]: Abstraction has 77004 states and 113416 transitions. [2019-09-08 13:08:56,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:08:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 77004 states and 113416 transitions. [2019-09-08 13:08:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 13:08:56,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:56,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:08:56,377 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1479976886, now seen corresponding path program 1 times [2019-09-08 13:08:56,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:56,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:57,389 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-08 13:08:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:58,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:58,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 13:08:58,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 13:08:58,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 13:08:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:08:58,476 INFO L87 Difference]: Start difference. First operand 77004 states and 113416 transitions. Second operand 21 states. [2019-09-08 13:08:59,236 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 13:08:59,421 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 13:08:59,695 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-08 13:08:59,934 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-08 13:09:00,500 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 13:09:00,665 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 13:09:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:13,806 INFO L93 Difference]: Finished difference Result 178019 states and 264315 transitions. [2019-09-08 13:09:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 13:09:13,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-08 13:09:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:13,976 INFO L225 Difference]: With dead ends: 178019 [2019-09-08 13:09:13,976 INFO L226 Difference]: Without dead ends: 110920 [2019-09-08 13:09:14,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 13:09:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110920 states. [2019-09-08 13:09:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110920 to 96973. [2019-09-08 13:09:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96973 states. [2019-09-08 13:09:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96973 states to 96973 states and 142342 transitions. [2019-09-08 13:09:25,886 INFO L78 Accepts]: Start accepts. Automaton has 96973 states and 142342 transitions. Word has length 184 [2019-09-08 13:09:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:25,886 INFO L475 AbstractCegarLoop]: Abstraction has 96973 states and 142342 transitions. [2019-09-08 13:09:25,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 13:09:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 96973 states and 142342 transitions. [2019-09-08 13:09:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 13:09:25,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:25,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:25,901 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1347217683, now seen corresponding path program 1 times [2019-09-08 13:09:25,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:25,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:25,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:26,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 13:09:26,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:26,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:09:26,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:09:26,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:09:26,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:09:26,004 INFO L87 Difference]: Start difference. First operand 96973 states and 142342 transitions. Second operand 4 states. [2019-09-08 13:09:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:09:40,927 INFO L93 Difference]: Finished difference Result 241387 states and 357847 transitions. [2019-09-08 13:09:40,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:09:40,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-08 13:09:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:09:41,188 INFO L225 Difference]: With dead ends: 241387 [2019-09-08 13:09:41,188 INFO L226 Difference]: Without dead ends: 169465 [2019-09-08 13:09:41,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169465 states. [2019-09-08 13:09:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169465 to 98857. [2019-09-08 13:09:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98857 states. [2019-09-08 13:09:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98857 states to 98857 states and 144404 transitions. [2019-09-08 13:09:55,155 INFO L78 Accepts]: Start accepts. Automaton has 98857 states and 144404 transitions. Word has length 184 [2019-09-08 13:09:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:55,156 INFO L475 AbstractCegarLoop]: Abstraction has 98857 states and 144404 transitions. [2019-09-08 13:09:55,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 98857 states and 144404 transitions. [2019-09-08 13:09:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 13:09:55,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:55,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:55,171 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1351844283, now seen corresponding path program 1 times [2019-09-08 13:09:55,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:55,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:55,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:55,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:55,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:09:55,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:09:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:09:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:09:55,323 INFO L87 Difference]: Start difference. First operand 98857 states and 144404 transitions. Second operand 5 states. [2019-09-08 13:10:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:12,088 INFO L93 Difference]: Finished difference Result 266957 states and 393215 transitions. [2019-09-08 13:10:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:10:12,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-08 13:10:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:12,344 INFO L225 Difference]: With dead ends: 266957 [2019-09-08 13:10:12,344 INFO L226 Difference]: Without dead ends: 169465 [2019-09-08 13:10:12,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:10:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169465 states. [2019-09-08 13:10:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169465 to 152580. [2019-09-08 13:10:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152580 states. [2019-09-08 13:10:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152580 states to 152580 states and 223100 transitions. [2019-09-08 13:10:31,699 INFO L78 Accepts]: Start accepts. Automaton has 152580 states and 223100 transitions. Word has length 184 [2019-09-08 13:10:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:31,700 INFO L475 AbstractCegarLoop]: Abstraction has 152580 states and 223100 transitions. [2019-09-08 13:10:31,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:10:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 152580 states and 223100 transitions. [2019-09-08 13:10:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 13:10:31,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:31,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:31,718 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:31,719 INFO L82 PathProgramCache]: Analyzing trace with hash 977794702, now seen corresponding path program 1 times [2019-09-08 13:10:31,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:31,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:31,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:31,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:31,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:32,850 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-08 13:10:33,099 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-09-08 13:10:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:10:34,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:34,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 13:10:34,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 13:10:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 13:10:34,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:10:34,008 INFO L87 Difference]: Start difference. First operand 152580 states and 223100 transitions. Second operand 21 states. [2019-09-08 13:10:34,724 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 13:10:34,928 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-08 13:10:35,373 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-08 13:10:35,620 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 13:10:35,791 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 13:10:35,985 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 13:10:36,176 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-08 13:10:36,610 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-08 13:10:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:59,363 INFO L93 Difference]: Finished difference Result 265972 states and 389344 transitions. [2019-09-08 13:10:59,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 13:10:59,363 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 184 [2019-09-08 13:10:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:59,659 INFO L225 Difference]: With dead ends: 265972 [2019-09-08 13:10:59,659 INFO L226 Difference]: Without dead ends: 196522 [2019-09-08 13:10:59,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 13:10:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196522 states. [2019-09-08 13:11:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196522 to 153175. [2019-09-08 13:11:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153175 states. [2019-09-08 13:11:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153175 states to 153175 states and 223789 transitions. [2019-09-08 13:11:19,347 INFO L78 Accepts]: Start accepts. Automaton has 153175 states and 223789 transitions. Word has length 184 [2019-09-08 13:11:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:19,347 INFO L475 AbstractCegarLoop]: Abstraction has 153175 states and 223789 transitions. [2019-09-08 13:11:19,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 13:11:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 153175 states and 223789 transitions. [2019-09-08 13:11:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 13:11:19,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:19,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:19,375 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1522390191, now seen corresponding path program 1 times [2019-09-08 13:11:19,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:19,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:19,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:19,448 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 13:11:19,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:19,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:11:19,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:11:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:11:19,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:11:19,450 INFO L87 Difference]: Start difference. First operand 153175 states and 223789 transitions. Second operand 3 states. [2019-09-08 13:11:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:38,766 INFO L93 Difference]: Finished difference Result 264616 states and 387630 transitions. [2019-09-08 13:11:38,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:11:38,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 13:11:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:39,007 INFO L225 Difference]: With dead ends: 264616 [2019-09-08 13:11:39,007 INFO L226 Difference]: Without dead ends: 152456 [2019-09-08 13:11:39,106 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 13:11:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152456 states. [2019-09-08 13:11:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152456 to 152456. [2019-09-08 13:11:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152456 states. [2019-09-08 13:11:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152456 states to 152456 states and 222341 transitions. [2019-09-08 13:11:54,779 INFO L78 Accepts]: Start accepts. Automaton has 152456 states and 222341 transitions. Word has length 185 [2019-09-08 13:11:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:54,779 INFO L475 AbstractCegarLoop]: Abstraction has 152456 states and 222341 transitions. [2019-09-08 13:11:54,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:11:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 152456 states and 222341 transitions. [2019-09-08 13:11:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 13:11:54,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:54,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:54,800 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:54,800 INFO L82 PathProgramCache]: Analyzing trace with hash 62436878, now seen corresponding path program 1 times [2019-09-08 13:11:54,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:54,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:54,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:54,884 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 13:11:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:11:54,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:11:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:11:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:11:54,887 INFO L87 Difference]: Start difference. First operand 152456 states and 222341 transitions. Second operand 3 states. [2019-09-08 13:12:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:14,885 INFO L93 Difference]: Finished difference Result 268512 states and 390073 transitions. [2019-09-08 13:12:14,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:12:14,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 13:12:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:15,130 INFO L225 Difference]: With dead ends: 268512 [2019-09-08 13:12:15,131 INFO L226 Difference]: Without dead ends: 163998 [2019-09-08 13:12:15,217 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 13:12:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163998 states. [2019-09-08 13:12:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163998 to 151906. [2019-09-08 13:12:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151906 states. [2019-09-08 13:12:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151906 states to 151906 states and 220696 transitions. [2019-09-08 13:12:31,630 INFO L78 Accepts]: Start accepts. Automaton has 151906 states and 220696 transitions. Word has length 185 [2019-09-08 13:12:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:31,630 INFO L475 AbstractCegarLoop]: Abstraction has 151906 states and 220696 transitions. [2019-09-08 13:12:31,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:12:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 151906 states and 220696 transitions. [2019-09-08 13:12:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 13:12:31,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:31,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:31,982 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1641134443, now seen corresponding path program 1 times [2019-09-08 13:12:31,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:31,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:32,054 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 13:12:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:12:32,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:12:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:12:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:12:32,057 INFO L87 Difference]: Start difference. First operand 151906 states and 220696 transitions. Second operand 3 states. [2019-09-08 13:12:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:51,987 INFO L93 Difference]: Finished difference Result 270776 states and 392366 transitions. [2019-09-08 13:12:51,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:12:51,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 13:12:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:52,247 INFO L225 Difference]: With dead ends: 270776 [2019-09-08 13:12:52,248 INFO L226 Difference]: Without dead ends: 166824 [2019-09-08 13:12:52,327 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 13:12:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166824 states. [2019-09-08 13:13:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166824 to 150069. [2019-09-08 13:13:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150069 states. [2019-09-08 13:13:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150069 states to 150069 states and 217923 transitions. [2019-09-08 13:13:09,080 INFO L78 Accepts]: Start accepts. Automaton has 150069 states and 217923 transitions. Word has length 185 [2019-09-08 13:13:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:09,081 INFO L475 AbstractCegarLoop]: Abstraction has 150069 states and 217923 transitions. [2019-09-08 13:13:09,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:13:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 150069 states and 217923 transitions. [2019-09-08 13:13:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 13:13:09,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:09,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:09,099 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -342638478, now seen corresponding path program 1 times [2019-09-08 13:13:09,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:09,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:09,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:09,167 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 13:13:09,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:09,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:13:09,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:13:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:13:09,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:13:09,169 INFO L87 Difference]: Start difference. First operand 150069 states and 217923 transitions. Second operand 3 states. [2019-09-08 13:13:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:27,343 INFO L93 Difference]: Finished difference Result 259937 states and 377326 transitions. [2019-09-08 13:13:27,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:13:27,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 13:13:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:27,576 INFO L225 Difference]: With dead ends: 259937 [2019-09-08 13:13:27,576 INFO L226 Difference]: Without dead ends: 150165 [2019-09-08 13:13:27,671 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 13:13:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150165 states. [2019-09-08 13:13:43,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150165 to 148942. [2019-09-08 13:13:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148942 states. [2019-09-08 13:13:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148942 states to 148942 states and 215661 transitions. [2019-09-08 13:13:43,600 INFO L78 Accepts]: Start accepts. Automaton has 148942 states and 215661 transitions. Word has length 185 [2019-09-08 13:13:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:43,600 INFO L475 AbstractCegarLoop]: Abstraction has 148942 states and 215661 transitions. [2019-09-08 13:13:43,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:13:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 148942 states and 215661 transitions. [2019-09-08 13:13:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 13:13:43,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:43,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:43,621 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1994345695, now seen corresponding path program 1 times [2019-09-08 13:13:43,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:43,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:43,688 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 13:13:43,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:13:43,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:13:43,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:13:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:13:43,695 INFO L87 Difference]: Start difference. First operand 148942 states and 215661 transitions. Second operand 3 states. [2019-09-08 13:14:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:00,637 INFO L93 Difference]: Finished difference Result 271730 states and 390960 transitions. [2019-09-08 13:14:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:00,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 13:14:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:00,870 INFO L225 Difference]: With dead ends: 271730 [2019-09-08 13:14:00,870 INFO L226 Difference]: Without dead ends: 162741 [2019-09-08 13:14:00,951 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 13:14:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162741 states. [2019-09-08 13:14:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162741 to 148330. [2019-09-08 13:14:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148330 states. [2019-09-08 13:14:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148330 states to 148330 states and 213827 transitions. [2019-09-08 13:14:21,311 INFO L78 Accepts]: Start accepts. Automaton has 148330 states and 213827 transitions. Word has length 185 [2019-09-08 13:14:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:21,311 INFO L475 AbstractCegarLoop]: Abstraction has 148330 states and 213827 transitions. [2019-09-08 13:14:21,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 148330 states and 213827 transitions. [2019-09-08 13:14:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 13:14:21,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:21,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:21,329 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -478851934, now seen corresponding path program 1 times [2019-09-08 13:14:21,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:21,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:21,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:21,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:21,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:21,393 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 13:14:21,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:21,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:21,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:21,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:21,395 INFO L87 Difference]: Start difference. First operand 148330 states and 213827 transitions. Second operand 3 states. [2019-09-08 13:14:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:37,480 INFO L93 Difference]: Finished difference Result 268434 states and 387412 transitions. [2019-09-08 13:14:37,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:37,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 13:14:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:37,724 INFO L225 Difference]: With dead ends: 268434 [2019-09-08 13:14:37,724 INFO L226 Difference]: Without dead ends: 146374 [2019-09-08 13:14:37,814 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 13:14:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146374 states. [2019-09-08 13:14:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146374 to 146374. [2019-09-08 13:14:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146374 states. [2019-09-08 13:14:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146374 states to 146374 states and 210789 transitions. [2019-09-08 13:14:52,702 INFO L78 Accepts]: Start accepts. Automaton has 146374 states and 210789 transitions. Word has length 185 [2019-09-08 13:14:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:52,702 INFO L475 AbstractCegarLoop]: Abstraction has 146374 states and 210789 transitions. [2019-09-08 13:14:52,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 146374 states and 210789 transitions. [2019-09-08 13:14:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 13:14:52,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:52,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:52,720 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1014323284, now seen corresponding path program 1 times [2019-09-08 13:14:52,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:52,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:52,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:52,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:52,846 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 13:14:52,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:52,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:52,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:52,848 INFO L87 Difference]: Start difference. First operand 146374 states and 210789 transitions. Second operand 4 states. [2019-09-08 13:15:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:12,144 INFO L93 Difference]: Finished difference Result 274555 states and 400656 transitions. [2019-09-08 13:15:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:12,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-09-08 13:15:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:12,357 INFO L225 Difference]: With dead ends: 274555 [2019-09-08 13:15:12,358 INFO L226 Difference]: Without dead ends: 146310 [2019-09-08 13:15:12,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 13:15:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146310 states. [2019-09-08 13:15:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146310 to 146308. [2019-09-08 13:15:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146308 states. [2019-09-08 13:15:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146308 states to 146308 states and 210092 transitions. [2019-09-08 13:15:27,883 INFO L78 Accepts]: Start accepts. Automaton has 146308 states and 210092 transitions. Word has length 187 [2019-09-08 13:15:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:27,884 INFO L475 AbstractCegarLoop]: Abstraction has 146308 states and 210092 transitions. [2019-09-08 13:15:27,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 146308 states and 210092 transitions. [2019-09-08 13:15:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 13:15:27,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:27,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:27,903 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash -718250076, now seen corresponding path program 1 times [2019-09-08 13:15:27,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:29,677 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 13:15:29,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:29,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 13:15:29,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 13:15:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 13:15:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 13:15:29,679 INFO L87 Difference]: Start difference. First operand 146308 states and 210092 transitions. Second operand 22 states. [2019-09-08 13:15:30,801 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 13:15:31,005 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 13:15:31,203 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 13:15:31,404 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 13:15:31,574 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-08 13:15:33,708 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2019-09-08 13:15:33,959 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-08 13:15:34,545 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-08 13:15:34,967 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2019-09-08 13:15:35,105 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-08 13:15:35,277 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-08 13:15:35,743 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-09-08 13:15:36,215 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 32 [2019-09-08 13:15:36,394 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 13:15:36,573 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-08 13:15:36,745 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 13:15:36,997 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-08 13:15:38,259 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 13:15:43,481 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 32 [2019-09-08 13:16:03,397 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-09-08 13:16:06,248 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-08 13:16:11,157 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 32 [2019-09-08 13:16:12,835 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-09-08 13:16:13,755 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-08 13:16:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:14,071 INFO L93 Difference]: Finished difference Result 295277 states and 427860 transitions. [2019-09-08 13:16:14,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 13:16:14,072 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 187 [2019-09-08 13:16:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:14,632 INFO L225 Difference]: With dead ends: 295277 [2019-09-08 13:16:14,633 INFO L226 Difference]: Without dead ends: 269047 [2019-09-08 13:16:14,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=964, Invalid=2818, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 13:16:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269047 states. [2019-09-08 13:16:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269047 to 146770. [2019-09-08 13:16:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146770 states. [2019-09-08 13:16:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146770 states to 146770 states and 210601 transitions. [2019-09-08 13:16:32,227 INFO L78 Accepts]: Start accepts. Automaton has 146770 states and 210601 transitions. Word has length 187 [2019-09-08 13:16:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:32,228 INFO L475 AbstractCegarLoop]: Abstraction has 146770 states and 210601 transitions. [2019-09-08 13:16:32,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 13:16:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 146770 states and 210601 transitions. [2019-09-08 13:16:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 13:16:32,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:32,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:32,249 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash -932837444, now seen corresponding path program 1 times [2019-09-08 13:16:32,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:32,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:32,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:32,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:32,476 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 13:16:32,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:32,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:16:32,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:16:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:16:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:16:32,477 INFO L87 Difference]: Start difference. First operand 146770 states and 210601 transitions. Second operand 8 states. [2019-09-08 13:16:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:49,275 INFO L93 Difference]: Finished difference Result 273883 states and 398598 transitions. [2019-09-08 13:16:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:16:49,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 187 [2019-09-08 13:16:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:49,563 INFO L225 Difference]: With dead ends: 273883 [2019-09-08 13:16:49,564 INFO L226 Difference]: Without dead ends: 146641 [2019-09-08 13:16:49,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:16:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146641 states. [2019-09-08 13:17:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146641 to 146639. [2019-09-08 13:17:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146639 states. [2019-09-08 13:17:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146639 states to 146639 states and 209620 transitions. [2019-09-08 13:17:11,237 INFO L78 Accepts]: Start accepts. Automaton has 146639 states and 209620 transitions. Word has length 187 [2019-09-08 13:17:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:11,237 INFO L475 AbstractCegarLoop]: Abstraction has 146639 states and 209620 transitions. [2019-09-08 13:17:11,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:17:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 146639 states and 209620 transitions. [2019-09-08 13:17:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 13:17:11,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:11,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:11,256 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1506636302, now seen corresponding path program 1 times [2019-09-08 13:17:11,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:11,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:11,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:11,409 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 13:17:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:17:11,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:17:11,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:17:11,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:17:11,411 INFO L87 Difference]: Start difference. First operand 146639 states and 209620 transitions. Second operand 5 states. [2019-09-08 13:18:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:00,225 INFO L93 Difference]: Finished difference Result 523127 states and 764881 transitions. [2019-09-08 13:18:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:18:00,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-08 13:18:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:00,930 INFO L225 Difference]: With dead ends: 523127 [2019-09-08 13:18:00,930 INFO L226 Difference]: Without dead ends: 397619 [2019-09-08 13:18:01,098 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 13:18:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397619 states.