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_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:31:45,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:31:45,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:31:45,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:31:45,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:31:45,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:31:45,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:31:45,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:31:45,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:31:45,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:31:45,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:31:45,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:31:45,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:31:45,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:31:45,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:31:45,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:31:45,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:31:45,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:31:45,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:31:45,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:31:45,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:31:45,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:31:45,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:31:45,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:31:45,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:31:45,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:31:45,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:31:45,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:31:45,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:31:45,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:31:45,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:31:45,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:31:45,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:31:45,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:31:45,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:31:45,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:31:45,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:31:45,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:31:45,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:31:45,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:31:45,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:31:45,602 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 09:31:45,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:31:45,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:31:45,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:31:45,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:31:45,625 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:31:45,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:31:45,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:31:45,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:31:45,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:31:45,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:31:45,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:31:45,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:31:45,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:31:45,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:31:45,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:31:45,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:31:45,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:31:45,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:31:45,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:31:45,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:31:45,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:31:45,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:31:45,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:31:45,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:31:45,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:31:45,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:31:45,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:31:45,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:31:45,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:31:45,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:31:45,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:31:45,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:31:45,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:31:45,684 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:31:45,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:31:45,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4983c88d/1275acfba33e4e0b80eec5abffedca7e/FLAGe25283c99 [2019-09-08 09:31:46,333 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:31:46,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:31:46,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4983c88d/1275acfba33e4e0b80eec5abffedca7e/FLAGe25283c99 [2019-09-08 09:31:46,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4983c88d/1275acfba33e4e0b80eec5abffedca7e [2019-09-08 09:31:46,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:31:46,633 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:31:46,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:31:46,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:31:46,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:31:46,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:31:46" (1/1) ... [2019-09-08 09:31:46,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f343ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:46, skipping insertion in model container [2019-09-08 09:31:46,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:31:46" (1/1) ... [2019-09-08 09:31:46,646 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:31:46,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:31:47,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:31:47,253 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:31:47,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:31:47,436 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:31:47,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47 WrapperNode [2019-09-08 09:31:47,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:31:47,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:31:47,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:31:47,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:31:47,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (1/1) ... [2019-09-08 09:31:47,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (1/1) ... [2019-09-08 09:31:47,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (1/1) ... [2019-09-08 09:31:47,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (1/1) ... [2019-09-08 09:31:47,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (1/1) ... [2019-09-08 09:31:47,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (1/1) ... [2019-09-08 09:31:47,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (1/1) ... [2019-09-08 09:31:47,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:31:47,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:31:47,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:31:47,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:31:47,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (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 09:31:47,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:31:47,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:31:47,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:31:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:31:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:31:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:31:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:31:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:31:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:31:47,613 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:31:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:31:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:31:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:31:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:31:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:31:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:31:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:31:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:31:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:31:49,123 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:31:49,124 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:31:49,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:31:49 BoogieIcfgContainer [2019-09-08 09:31:49,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:31:49,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:31:49,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:31:49,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:31:49,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:31:46" (1/3) ... [2019-09-08 09:31:49,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b946435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:31:49, skipping insertion in model container [2019-09-08 09:31:49,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:31:47" (2/3) ... [2019-09-08 09:31:49,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b946435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:31:49, skipping insertion in model container [2019-09-08 09:31:49,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:31:49" (3/3) ... [2019-09-08 09:31:49,133 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:31:49,142 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:31:49,151 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:31:49,167 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:31:49,200 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:31:49,201 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:31:49,201 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:31:49,202 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:31:49,202 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:31:49,202 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:31:49,202 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:31:49,202 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:31:49,203 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:31:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states. [2019-09-08 09:31:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:31:49,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:49,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:49,245 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash 885340602, now seen corresponding path program 1 times [2019-09-08 09:31:49,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:49,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:49,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:49,905 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 09:31:49,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:49,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:49,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:49,938 INFO L87 Difference]: Start difference. First operand 317 states. Second operand 3 states. [2019-09-08 09:31:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:50,242 INFO L93 Difference]: Finished difference Result 641 states and 1120 transitions. [2019-09-08 09:31:50,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:50,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 09:31:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:50,265 INFO L225 Difference]: With dead ends: 641 [2019-09-08 09:31:50,265 INFO L226 Difference]: Without dead ends: 514 [2019-09-08 09:31:50,272 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 09:31:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-08 09:31:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-09-08 09:31:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 09:31:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-09-08 09:31:50,361 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 150 [2019-09-08 09:31:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:50,362 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-09-08 09:31:50,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-09-08 09:31:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:31:50,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:50,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:50,367 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash -20093490, now seen corresponding path program 1 times [2019-09-08 09:31:50,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:50,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:31:50,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:50,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:50,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:50,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:50,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:50,546 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 3 states. [2019-09-08 09:31:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:50,709 INFO L93 Difference]: Finished difference Result 1076 states and 1646 transitions. [2019-09-08 09:31:50,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:50,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 09:31:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:50,722 INFO L225 Difference]: With dead ends: 1076 [2019-09-08 09:31:50,722 INFO L226 Difference]: Without dead ends: 884 [2019-09-08 09:31:50,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2019-09-08 09:31:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2019-09-08 09:31:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-09-08 09:31:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1323 transitions. [2019-09-08 09:31:50,788 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1323 transitions. Word has length 150 [2019-09-08 09:31:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:50,789 INFO L475 AbstractCegarLoop]: Abstraction has 882 states and 1323 transitions. [2019-09-08 09:31:50,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1323 transitions. [2019-09-08 09:31:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 09:31:50,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:50,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:50,794 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1175617460, now seen corresponding path program 1 times [2019-09-08 09:31:50,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:50,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:50,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:50,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:50,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:51,126 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 09:31:51,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:51,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:51,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:51,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:51,129 INFO L87 Difference]: Start difference. First operand 882 states and 1323 transitions. Second operand 4 states. [2019-09-08 09:31:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:51,285 INFO L93 Difference]: Finished difference Result 2577 states and 3862 transitions. [2019-09-08 09:31:51,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:51,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-08 09:31:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:51,301 INFO L225 Difference]: With dead ends: 2577 [2019-09-08 09:31:51,301 INFO L226 Difference]: Without dead ends: 1708 [2019-09-08 09:31:51,307 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 09:31:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-09-08 09:31:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2019-09-08 09:31:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-09-08 09:31:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2536 transitions. [2019-09-08 09:31:51,402 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2536 transitions. Word has length 150 [2019-09-08 09:31:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:51,403 INFO L475 AbstractCegarLoop]: Abstraction has 1706 states and 2536 transitions. [2019-09-08 09:31:51,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:31:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2536 transitions. [2019-09-08 09:31:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 09:31:51,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:51,409 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] [2019-09-08 09:31:51,409 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash -522806920, now seen corresponding path program 1 times [2019-09-08 09:31:51,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:51,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:51,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:51,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:51,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:51,486 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 09:31:51,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:51,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:51,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:51,488 INFO L87 Difference]: Start difference. First operand 1706 states and 2536 transitions. Second operand 3 states. [2019-09-08 09:31:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:51,676 INFO L93 Difference]: Finished difference Result 5072 states and 7538 transitions. [2019-09-08 09:31:51,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:51,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 09:31:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:51,693 INFO L225 Difference]: With dead ends: 5072 [2019-09-08 09:31:51,694 INFO L226 Difference]: Without dead ends: 3398 [2019-09-08 09:31:51,697 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 09:31:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-09-08 09:31:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 1708. [2019-09-08 09:31:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-09-08 09:31:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2538 transitions. [2019-09-08 09:31:51,805 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2538 transitions. Word has length 151 [2019-09-08 09:31:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:51,805 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2538 transitions. [2019-09-08 09:31:51,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2538 transitions. [2019-09-08 09:31:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 09:31:51,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:51,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:51,809 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1124709406, now seen corresponding path program 1 times [2019-09-08 09:31:51,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:51,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:51,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:51,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:51,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:51,915 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 09:31:51,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:51,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:51,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:51,917 INFO L87 Difference]: Start difference. First operand 1708 states and 2538 transitions. Second operand 3 states. [2019-09-08 09:31:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:52,125 INFO L93 Difference]: Finished difference Result 4838 states and 7205 transitions. [2019-09-08 09:31:52,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:52,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 09:31:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:52,144 INFO L225 Difference]: With dead ends: 4838 [2019-09-08 09:31:52,144 INFO L226 Difference]: Without dead ends: 3310 [2019-09-08 09:31:52,149 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 09:31:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-09-08 09:31:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3308. [2019-09-08 09:31:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-09-08 09:31:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4871 transitions. [2019-09-08 09:31:52,417 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4871 transitions. Word has length 152 [2019-09-08 09:31:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:52,418 INFO L475 AbstractCegarLoop]: Abstraction has 3308 states and 4871 transitions. [2019-09-08 09:31:52,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4871 transitions. [2019-09-08 09:31:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 09:31:52,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:52,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:52,425 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash -617278081, now seen corresponding path program 1 times [2019-09-08 09:31:52,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:52,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:52,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:52,607 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 09:31:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:52,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:52,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:52,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:52,609 INFO L87 Difference]: Start difference. First operand 3308 states and 4871 transitions. Second operand 4 states. [2019-09-08 09:31:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:52,777 INFO L93 Difference]: Finished difference Result 5666 states and 8353 transitions. [2019-09-08 09:31:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:52,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-08 09:31:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:52,795 INFO L225 Difference]: With dead ends: 5666 [2019-09-08 09:31:52,795 INFO L226 Difference]: Without dead ends: 2528 [2019-09-08 09:31:52,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 09:31:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-09-08 09:31:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2019-09-08 09:31:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2019-09-08 09:31:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3707 transitions. [2019-09-08 09:31:52,998 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3707 transitions. Word has length 152 [2019-09-08 09:31:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:52,999 INFO L475 AbstractCegarLoop]: Abstraction has 2528 states and 3707 transitions. [2019-09-08 09:31:52,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:31:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3707 transitions. [2019-09-08 09:31:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:31:53,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:53,007 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 09:31:53,007 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:53,008 INFO L82 PathProgramCache]: Analyzing trace with hash 696225132, now seen corresponding path program 1 times [2019-09-08 09:31:53,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:53,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:53,166 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 09:31:53,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:53,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:53,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:53,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:53,168 INFO L87 Difference]: Start difference. First operand 2528 states and 3707 transitions. Second operand 3 states. [2019-09-08 09:31:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:53,611 INFO L93 Difference]: Finished difference Result 6812 states and 10094 transitions. [2019-09-08 09:31:53,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:31:53,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-08 09:31:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:53,634 INFO L225 Difference]: With dead ends: 6812 [2019-09-08 09:31:53,634 INFO L226 Difference]: Without dead ends: 4696 [2019-09-08 09:31:53,640 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 09:31:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-09-08 09:31:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4694. [2019-09-08 09:31:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-09-08 09:31:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 6887 transitions. [2019-09-08 09:31:53,884 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 6887 transitions. Word has length 158 [2019-09-08 09:31:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:53,885 INFO L475 AbstractCegarLoop]: Abstraction has 4694 states and 6887 transitions. [2019-09-08 09:31:53,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 6887 transitions. [2019-09-08 09:31:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:31:53,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:53,894 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 09:31:53,895 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599087, now seen corresponding path program 1 times [2019-09-08 09:31:53,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:54,109 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 09:31:54,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:54,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:31:54,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:31:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:31:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:31:54,111 INFO L87 Difference]: Start difference. First operand 4694 states and 6887 transitions. Second operand 5 states. [2019-09-08 09:31:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:54,640 INFO L93 Difference]: Finished difference Result 8018 states and 11995 transitions. [2019-09-08 09:31:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:31:54,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-08 09:31:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:54,659 INFO L225 Difference]: With dead ends: 8018 [2019-09-08 09:31:54,659 INFO L226 Difference]: Without dead ends: 4076 [2019-09-08 09:31:54,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 09:31:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-09-08 09:31:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 4074. [2019-09-08 09:31:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2019-09-08 09:31:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 6064 transitions. [2019-09-08 09:31:54,926 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 6064 transitions. Word has length 158 [2019-09-08 09:31:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:54,927 INFO L475 AbstractCegarLoop]: Abstraction has 4074 states and 6064 transitions. [2019-09-08 09:31:54,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:31:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 6064 transitions. [2019-09-08 09:31:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:31:54,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:54,933 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 09:31:54,934 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash 11065959, now seen corresponding path program 1 times [2019-09-08 09:31:54,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:54,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:54,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:54,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:55,209 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 09:31:55,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:55,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:31:55,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:31:55,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:31:55,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:31:55,211 INFO L87 Difference]: Start difference. First operand 4074 states and 6064 transitions. Second operand 9 states. [2019-09-08 09:31:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:55,850 INFO L93 Difference]: Finished difference Result 10158 states and 15476 transitions. [2019-09-08 09:31:55,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:55,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-08 09:31:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:55,883 INFO L225 Difference]: With dead ends: 10158 [2019-09-08 09:31:55,884 INFO L226 Difference]: Without dead ends: 7798 [2019-09-08 09:31:55,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:31:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-09-08 09:31:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7796. [2019-09-08 09:31:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-09-08 09:31:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 11622 transitions. [2019-09-08 09:31:56,296 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 11622 transitions. Word has length 158 [2019-09-08 09:31:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:56,297 INFO L475 AbstractCegarLoop]: Abstraction has 7796 states and 11622 transitions. [2019-09-08 09:31:56,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:31:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 11622 transitions. [2019-09-08 09:31:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:31:56,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:56,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:56,308 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:56,308 INFO L82 PathProgramCache]: Analyzing trace with hash -362607228, now seen corresponding path program 1 times [2019-09-08 09:31:56,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:56,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:56,487 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 09:31:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:56,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:31:56,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:31:56,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:31:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:31:56,489 INFO L87 Difference]: Start difference. First operand 7796 states and 11622 transitions. Second operand 5 states. [2019-09-08 09:31:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:57,209 INFO L93 Difference]: Finished difference Result 16051 states and 25168 transitions. [2019-09-08 09:31:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:31:57,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-08 09:31:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:57,241 INFO L225 Difference]: With dead ends: 16051 [2019-09-08 09:31:57,241 INFO L226 Difference]: Without dead ends: 14213 [2019-09-08 09:31:57,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:31:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14213 states. [2019-09-08 09:31:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14213 to 10547. [2019-09-08 09:31:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10547 states. [2019-09-08 09:31:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10547 states to 10547 states and 16050 transitions. [2019-09-08 09:31:57,930 INFO L78 Accepts]: Start accepts. Automaton has 10547 states and 16050 transitions. Word has length 158 [2019-09-08 09:31:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:57,930 INFO L475 AbstractCegarLoop]: Abstraction has 10547 states and 16050 transitions. [2019-09-08 09:31:57,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:31:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 10547 states and 16050 transitions. [2019-09-08 09:31:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 09:31:57,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:57,941 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 09:31:57,941 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:57,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1963094895, now seen corresponding path program 1 times [2019-09-08 09:31:57,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:57,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:57,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:57,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:58,155 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 09:31:58,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:58,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:31:58,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:31:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:31:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:31:58,158 INFO L87 Difference]: Start difference. First operand 10547 states and 16050 transitions. Second operand 4 states. [2019-09-08 09:31:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:31:59,295 INFO L93 Difference]: Finished difference Result 27676 states and 42109 transitions. [2019-09-08 09:31:59,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:31:59,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-08 09:31:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:31:59,337 INFO L225 Difference]: With dead ends: 27676 [2019-09-08 09:31:59,337 INFO L226 Difference]: Without dead ends: 17138 [2019-09-08 09:31:59,359 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 09:31:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17138 states. [2019-09-08 09:32:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17138 to 17136. [2019-09-08 09:32:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17136 states. [2019-09-08 09:32:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17136 states to 17136 states and 25825 transitions. [2019-09-08 09:32:00,983 INFO L78 Accepts]: Start accepts. Automaton has 17136 states and 25825 transitions. Word has length 158 [2019-09-08 09:32:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:00,984 INFO L475 AbstractCegarLoop]: Abstraction has 17136 states and 25825 transitions. [2019-09-08 09:32:00,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 17136 states and 25825 transitions. [2019-09-08 09:32:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 09:32:00,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:00,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:01,000 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1251669041, now seen corresponding path program 1 times [2019-09-08 09:32:01,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:01,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:01,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:01,097 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 09:32:01,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:01,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:01,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:01,099 INFO L87 Difference]: Start difference. First operand 17136 states and 25825 transitions. Second operand 3 states. [2019-09-08 09:32:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:02,220 INFO L93 Difference]: Finished difference Result 46564 states and 70069 transitions. [2019-09-08 09:32:02,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:02,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 09:32:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:02,280 INFO L225 Difference]: With dead ends: 46564 [2019-09-08 09:32:02,281 INFO L226 Difference]: Without dead ends: 29789 [2019-09-08 09:32:02,314 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 09:32:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29789 states. [2019-09-08 09:32:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29789 to 29787. [2019-09-08 09:32:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29787 states. [2019-09-08 09:32:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29787 states to 29787 states and 44255 transitions. [2019-09-08 09:32:03,717 INFO L78 Accepts]: Start accepts. Automaton has 29787 states and 44255 transitions. Word has length 160 [2019-09-08 09:32:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:03,718 INFO L475 AbstractCegarLoop]: Abstraction has 29787 states and 44255 transitions. [2019-09-08 09:32:03,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29787 states and 44255 transitions. [2019-09-08 09:32:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 09:32:03,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:03,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:03,743 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:03,744 INFO L82 PathProgramCache]: Analyzing trace with hash -488936532, now seen corresponding path program 1 times [2019-09-08 09:32:03,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:03,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:03,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:03,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:03,872 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 09:32:03,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:03,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:03,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:03,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:03,874 INFO L87 Difference]: Start difference. First operand 29787 states and 44255 transitions. Second operand 4 states. [2019-09-08 09:32:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:04,905 INFO L93 Difference]: Finished difference Result 49804 states and 73990 transitions. [2019-09-08 09:32:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:32:04,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-08 09:32:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:04,952 INFO L225 Difference]: With dead ends: 49804 [2019-09-08 09:32:04,952 INFO L226 Difference]: Without dead ends: 26866 [2019-09-08 09:32:04,997 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 09:32:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26866 states. [2019-09-08 09:32:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26866 to 26866. [2019-09-08 09:32:06,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26866 states. [2019-09-08 09:32:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26866 states to 26866 states and 39906 transitions. [2019-09-08 09:32:07,007 INFO L78 Accepts]: Start accepts. Automaton has 26866 states and 39906 transitions. Word has length 160 [2019-09-08 09:32:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:07,008 INFO L475 AbstractCegarLoop]: Abstraction has 26866 states and 39906 transitions. [2019-09-08 09:32:07,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 26866 states and 39906 transitions. [2019-09-08 09:32:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:32:07,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:07,030 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 09:32:07,031 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1120267668, now seen corresponding path program 1 times [2019-09-08 09:32:07,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:07,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:07,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:07,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:32:07,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:07,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:07,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:07,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:07,155 INFO L87 Difference]: Start difference. First operand 26866 states and 39906 transitions. Second operand 3 states. [2019-09-08 09:32:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:08,577 INFO L93 Difference]: Finished difference Result 51498 states and 78744 transitions. [2019-09-08 09:32:08,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:08,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 09:32:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:08,641 INFO L225 Difference]: With dead ends: 51498 [2019-09-08 09:32:08,641 INFO L226 Difference]: Without dead ends: 35044 [2019-09-08 09:32:08,664 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 09:32:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35044 states. [2019-09-08 09:32:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35044 to 34882. [2019-09-08 09:32:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34882 states. [2019-09-08 09:32:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34882 states to 34882 states and 52098 transitions. [2019-09-08 09:32:10,278 INFO L78 Accepts]: Start accepts. Automaton has 34882 states and 52098 transitions. Word has length 166 [2019-09-08 09:32:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:10,279 INFO L475 AbstractCegarLoop]: Abstraction has 34882 states and 52098 transitions. [2019-09-08 09:32:10,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34882 states and 52098 transitions. [2019-09-08 09:32:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:32:10,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:10,295 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 09:32:10,295 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:10,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1417380321, now seen corresponding path program 1 times [2019-09-08 09:32:10,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:10,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:10,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:10,464 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 09:32:10,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:10,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:32:10,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:32:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:32:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:10,466 INFO L87 Difference]: Start difference. First operand 34882 states and 52098 transitions. Second operand 5 states. [2019-09-08 09:32:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:13,395 INFO L93 Difference]: Finished difference Result 77290 states and 119066 transitions. [2019-09-08 09:32:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:32:13,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-08 09:32:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:13,490 INFO L225 Difference]: With dead ends: 77290 [2019-09-08 09:32:13,490 INFO L226 Difference]: Without dead ends: 59960 [2019-09-08 09:32:13,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:32:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59960 states. [2019-09-08 09:32:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59960 to 37214. [2019-09-08 09:32:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37214 states. [2019-09-08 09:32:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37214 states to 37214 states and 55854 transitions. [2019-09-08 09:32:15,356 INFO L78 Accepts]: Start accepts. Automaton has 37214 states and 55854 transitions. Word has length 166 [2019-09-08 09:32:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:15,356 INFO L475 AbstractCegarLoop]: Abstraction has 37214 states and 55854 transitions. [2019-09-08 09:32:15,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:32:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37214 states and 55854 transitions. [2019-09-08 09:32:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:32:15,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:15,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:15,369 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1681876025, now seen corresponding path program 1 times [2019-09-08 09:32:15,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:15,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:15,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:15,598 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 09:32:15,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:15,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:32:15,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:32:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:32:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:32:15,602 INFO L87 Difference]: Start difference. First operand 37214 states and 55854 transitions. Second operand 8 states. [2019-09-08 09:32:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:20,563 INFO L93 Difference]: Finished difference Result 96811 states and 148963 transitions. [2019-09-08 09:32:20,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:32:20,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-09-08 09:32:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:20,672 INFO L225 Difference]: With dead ends: 96811 [2019-09-08 09:32:20,672 INFO L226 Difference]: Without dead ends: 73921 [2019-09-08 09:32:20,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:32:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73921 states. [2019-09-08 09:32:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73921 to 70353. [2019-09-08 09:32:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70353 states. [2019-09-08 09:32:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70353 states to 70353 states and 107236 transitions. [2019-09-08 09:32:24,381 INFO L78 Accepts]: Start accepts. Automaton has 70353 states and 107236 transitions. Word has length 166 [2019-09-08 09:32:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:24,382 INFO L475 AbstractCegarLoop]: Abstraction has 70353 states and 107236 transitions. [2019-09-08 09:32:24,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:32:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 70353 states and 107236 transitions. [2019-09-08 09:32:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 09:32:24,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:24,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:24,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:24,393 INFO L82 PathProgramCache]: Analyzing trace with hash -479850760, now seen corresponding path program 1 times [2019-09-08 09:32:24,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:24,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:24,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:24,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:24,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:24,566 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 09:32:24,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:24,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:24,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:24,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:24,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:24,568 INFO L87 Difference]: Start difference. First operand 70353 states and 107236 transitions. Second operand 4 states. [2019-09-08 09:32:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:32,984 INFO L93 Difference]: Finished difference Result 205931 states and 313521 transitions. [2019-09-08 09:32:32,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:32:32,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 09:32:32,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:33,176 INFO L225 Difference]: With dead ends: 205931 [2019-09-08 09:32:33,176 INFO L226 Difference]: Without dead ends: 135621 [2019-09-08 09:32:33,259 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 09:32:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135621 states. [2019-09-08 09:32:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135621 to 135619. [2019-09-08 09:32:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135619 states. [2019-09-08 09:32:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135619 states to 135619 states and 204364 transitions. [2019-09-08 09:32:42,803 INFO L78 Accepts]: Start accepts. Automaton has 135619 states and 204364 transitions. Word has length 166 [2019-09-08 09:32:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:42,804 INFO L475 AbstractCegarLoop]: Abstraction has 135619 states and 204364 transitions. [2019-09-08 09:32:42,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 135619 states and 204364 transitions. [2019-09-08 09:32:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:32:42,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:42,825 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] [2019-09-08 09:32:42,825 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1030531842, now seen corresponding path program 1 times [2019-09-08 09:32:42,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:42,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:42,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:32:42,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:42,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:42,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:42,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:42,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:42,884 INFO L87 Difference]: Start difference. First operand 135619 states and 204364 transitions. Second operand 3 states. [2019-09-08 09:32:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:58,539 INFO L93 Difference]: Finished difference Result 406665 states and 612845 transitions. [2019-09-08 09:32:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:58,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 09:32:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:58,925 INFO L225 Difference]: With dead ends: 406665 [2019-09-08 09:32:58,926 INFO L226 Difference]: Without dead ends: 271151 [2019-09-08 09:32:59,454 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 09:32:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271151 states. [2019-09-08 09:33:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271151 to 135625. [2019-09-08 09:33:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135625 states. [2019-09-08 09:33:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135625 states to 135625 states and 204370 transitions. [2019-09-08 09:33:12,341 INFO L78 Accepts]: Start accepts. Automaton has 135625 states and 204370 transitions. Word has length 167 [2019-09-08 09:33:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:12,341 INFO L475 AbstractCegarLoop]: Abstraction has 135625 states and 204370 transitions. [2019-09-08 09:33:12,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:33:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 135625 states and 204370 transitions. [2019-09-08 09:33:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 09:33:12,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:12,366 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] [2019-09-08 09:33:12,366 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:12,367 INFO L82 PathProgramCache]: Analyzing trace with hash -430087111, now seen corresponding path program 1 times [2019-09-08 09:33:12,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:12,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:12,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:12,490 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 09:33:12,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:12,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:33:12,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:33:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:33:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:33:12,493 INFO L87 Difference]: Start difference. First operand 135625 states and 204370 transitions. Second operand 4 states. [2019-09-08 09:33:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:21,172 INFO L93 Difference]: Finished difference Result 271208 states and 408684 transitions. [2019-09-08 09:33:21,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:33:21,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 09:33:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:21,359 INFO L225 Difference]: With dead ends: 271208 [2019-09-08 09:33:21,359 INFO L226 Difference]: Without dead ends: 135619 [2019-09-08 09:33:21,436 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 09:33:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135619 states. [2019-09-08 09:33:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135619 to 135619. [2019-09-08 09:33:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135619 states. [2019-09-08 09:33:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135619 states to 135619 states and 204358 transitions. [2019-09-08 09:33:33,077 INFO L78 Accepts]: Start accepts. Automaton has 135619 states and 204358 transitions. Word has length 168 [2019-09-08 09:33:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:33,078 INFO L475 AbstractCegarLoop]: Abstraction has 135619 states and 204358 transitions. [2019-09-08 09:33:33,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:33:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 135619 states and 204358 transitions. [2019-09-08 09:33:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 09:33:33,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:33,102 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] [2019-09-08 09:33:33,103 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 590295178, now seen corresponding path program 1 times [2019-09-08 09:33:33,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:33,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:33,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:33,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:33,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:33,194 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 09:33:33,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:33,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:33:33,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:33:33,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:33:33,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:33:33,196 INFO L87 Difference]: Start difference. First operand 135619 states and 204358 transitions. Second operand 3 states. [2019-09-08 09:33:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:49,581 INFO L93 Difference]: Finished difference Result 336958 states and 506711 transitions. [2019-09-08 09:33:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:33:49,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 09:33:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:49,852 INFO L225 Difference]: With dead ends: 336958 [2019-09-08 09:33:49,852 INFO L226 Difference]: Without dead ends: 202014 [2019-09-08 09:33:49,938 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 09:33:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202014 states. [2019-09-08 09:34:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202014 to 202012. [2019-09-08 09:34:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202012 states. [2019-09-08 09:34:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202012 states to 202012 states and 299727 transitions. [2019-09-08 09:34:02,698 INFO L78 Accepts]: Start accepts. Automaton has 202012 states and 299727 transitions. Word has length 168 [2019-09-08 09:34:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:34:02,698 INFO L475 AbstractCegarLoop]: Abstraction has 202012 states and 299727 transitions. [2019-09-08 09:34:02,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:34:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 202012 states and 299727 transitions. [2019-09-08 09:34:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:34:02,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:34:02,725 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] [2019-09-08 09:34:02,726 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:34:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:34:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash 938171426, now seen corresponding path program 1 times [2019-09-08 09:34:02,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:34:02,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:34:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:02,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:34:02,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:34:02,810 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 09:34:02,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:34:02,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:34:02,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:34:02,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:34:02,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:34:02,812 INFO L87 Difference]: Start difference. First operand 202012 states and 299727 transitions. Second operand 3 states. [2019-09-08 09:34:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:34:24,143 INFO L93 Difference]: Finished difference Result 459793 states and 693047 transitions. [2019-09-08 09:34:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:34:24,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:34:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:34:24,571 INFO L225 Difference]: With dead ends: 459793 [2019-09-08 09:34:24,571 INFO L226 Difference]: Without dead ends: 287504 [2019-09-08 09:34:24,702 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 09:34:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287504 states. [2019-09-08 09:34:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287504 to 244031. [2019-09-08 09:34:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244031 states. [2019-09-08 09:34:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244031 states to 244031 states and 363948 transitions. [2019-09-08 09:34:45,827 INFO L78 Accepts]: Start accepts. Automaton has 244031 states and 363948 transitions. Word has length 174 [2019-09-08 09:34:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:34:45,828 INFO L475 AbstractCegarLoop]: Abstraction has 244031 states and 363948 transitions. [2019-09-08 09:34:45,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:34:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 244031 states and 363948 transitions. [2019-09-08 09:34:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:34:45,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:34:45,856 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] [2019-09-08 09:34:45,856 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:34:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:34:45,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1722974211, now seen corresponding path program 1 times [2019-09-08 09:34:45,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:34:45,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:34:45,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:34:45,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:34:46,104 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 09:34:46,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:34:46,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 09:34:46,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 09:34:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 09:34:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:34:46,106 INFO L87 Difference]: Start difference. First operand 244031 states and 363948 transitions. Second operand 10 states. [2019-09-08 09:35:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:35:06,769 INFO L93 Difference]: Finished difference Result 460826 states and 686938 transitions. [2019-09-08 09:35:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:35:06,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2019-09-08 09:35:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:35:07,454 INFO L225 Difference]: With dead ends: 460826 [2019-09-08 09:35:07,455 INFO L226 Difference]: Without dead ends: 244031 [2019-09-08 09:35:07,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:35:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244031 states. [2019-09-08 09:35:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244031 to 244031. [2019-09-08 09:35:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244031 states. [2019-09-08 09:35:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244031 states to 244031 states and 359183 transitions. [2019-09-08 09:35:30,460 INFO L78 Accepts]: Start accepts. Automaton has 244031 states and 359183 transitions. Word has length 174 [2019-09-08 09:35:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:30,460 INFO L475 AbstractCegarLoop]: Abstraction has 244031 states and 359183 transitions. [2019-09-08 09:35:30,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 09:35:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 244031 states and 359183 transitions. [2019-09-08 09:35:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:35:30,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:30,494 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] [2019-09-08 09:35:30,494 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1960603682, now seen corresponding path program 1 times [2019-09-08 09:35:30,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:30,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:30,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:30,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:30,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:30,642 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 09:35:30,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:30,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:35:30,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:35:30,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:35:30,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:35:30,643 INFO L87 Difference]: Start difference. First operand 244031 states and 359183 transitions. Second operand 5 states. [2019-09-08 09:36:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:14,505 INFO L93 Difference]: Finished difference Result 730239 states and 1099387 transitions. [2019-09-08 09:36:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:36:14,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-09-08 09:36:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:15,664 INFO L225 Difference]: With dead ends: 730239 [2019-09-08 09:36:15,665 INFO L226 Difference]: Without dead ends: 550425 [2019-09-08 09:36:15,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:36:16,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550425 states. [2019-09-08 09:37:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550425 to 526713. [2019-09-08 09:37:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526713 states. [2019-09-08 09:37:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526713 states to 526713 states and 790297 transitions. [2019-09-08 09:37:12,736 INFO L78 Accepts]: Start accepts. Automaton has 526713 states and 790297 transitions. Word has length 174 [2019-09-08 09:37:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:37:12,737 INFO L475 AbstractCegarLoop]: Abstraction has 526713 states and 790297 transitions. [2019-09-08 09:37:12,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:37:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 526713 states and 790297 transitions. [2019-09-08 09:37:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:37:12,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:37:12,768 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] [2019-09-08 09:37:12,769 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:37:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:37:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash 63372601, now seen corresponding path program 1 times [2019-09-08 09:37:12,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:37:12,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:37:12,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:12,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:37:12,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:37:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:37:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:37:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:37:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 09:37:13,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 09:37:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 09:37:13,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-08 09:37:13,281 INFO L87 Difference]: Start difference. First operand 526713 states and 790297 transitions. Second operand 19 states. [2019-09-08 09:38:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:57,492 INFO L93 Difference]: Finished difference Result 1225211 states and 1828889 transitions. [2019-09-08 09:38:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 09:38:57,493 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 174 [2019-09-08 09:38:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:59,573 INFO L225 Difference]: With dead ends: 1225211 [2019-09-08 09:38:59,573 INFO L226 Difference]: Without dead ends: 1154335 [2019-09-08 09:38:59,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:39:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154335 states. [2019-09-08 09:40:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154335 to 531303. [2019-09-08 09:40:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531303 states. [2019-09-08 09:40:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531303 states to 531303 states and 795668 transitions. [2019-09-08 09:40:18,226 INFO L78 Accepts]: Start accepts. Automaton has 531303 states and 795668 transitions. Word has length 174 [2019-09-08 09:40:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:18,226 INFO L475 AbstractCegarLoop]: Abstraction has 531303 states and 795668 transitions. [2019-09-08 09:40:18,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 09:40:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 531303 states and 795668 transitions. [2019-09-08 09:40:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:40:18,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:18,268 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] [2019-09-08 09:40:18,269 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1891624545, now seen corresponding path program 1 times [2019-09-08 09:40:18,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:18,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:18,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:18,666 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 09:40:18,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:18,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:40:18,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:40:18,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:40:18,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:40:18,668 INFO L87 Difference]: Start difference. First operand 531303 states and 795668 transitions. Second operand 16 states. [2019-09-08 09:42:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:37,844 INFO L93 Difference]: Finished difference Result 1307284 states and 1952382 transitions. [2019-09-08 09:42:37,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 09:42:37,844 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 174 [2019-09-08 09:42:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:39,882 INFO L225 Difference]: With dead ends: 1307284 [2019-09-08 09:42:39,883 INFO L226 Difference]: Without dead ends: 1236030 [2019-09-08 09:42:40,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 09:42:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236030 states.