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/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:21:23,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:21:23,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:21:23,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:21:23,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:21:23,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:21:23,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:21:23,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:21:23,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:21:23,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:21:23,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:21:23,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:21:23,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:21:23,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:21:23,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:21:23,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:21:23,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:21:23,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:21:23,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:21:23,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:21:23,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:21:23,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:21:23,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:21:23,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:21:23,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:21:23,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:21:23,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:21:23,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:21:23,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:21:23,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:21:23,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:21:23,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:21:23,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:21:23,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:21:23,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:21:23,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:21:23,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:21:23,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:21:23,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:21:23,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:21:23,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:21:23,772 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 08:21:23,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:21:23,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:21:23,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:21:23,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:21:23,800 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:21:23,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:21:23,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:21:23,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:21:23,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:21:23,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:21:23,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:21:23,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:21:23,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:21:23,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:21:23,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:21:23,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:21:23,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:21:23,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:21:23,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:21:23,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:21:23,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:21:23,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:21:23,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:21:23,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:21:23,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:21:23,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:21:23,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:21:23,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:21:23,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:21:23,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:21:23,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:21:23,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:21:23,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:21:23,850 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:21:23,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:21:23,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095a14bb1/d19c0237407a409c83ea67cc61ae2f76/FLAG2441d4af9 [2019-09-08 08:21:24,462 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:21:24,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:21:24,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095a14bb1/d19c0237407a409c83ea67cc61ae2f76/FLAG2441d4af9 [2019-09-08 08:21:24,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095a14bb1/d19c0237407a409c83ea67cc61ae2f76 [2019-09-08 08:21:24,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:21:24,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:21:24,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:21:24,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:21:24,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:21:24,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:21:24" (1/1) ... [2019-09-08 08:21:24,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe3a592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:24, skipping insertion in model container [2019-09-08 08:21:24,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:21:24" (1/1) ... [2019-09-08 08:21:24,789 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:21:24,875 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:21:25,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:21:25,352 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:21:25,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:21:25,483 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:21:25,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25 WrapperNode [2019-09-08 08:21:25,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:21:25,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:21:25,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:21:25,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:21:25,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (1/1) ... [2019-09-08 08:21:25,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (1/1) ... [2019-09-08 08:21:25,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (1/1) ... [2019-09-08 08:21:25,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (1/1) ... [2019-09-08 08:21:25,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (1/1) ... [2019-09-08 08:21:25,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (1/1) ... [2019-09-08 08:21:25,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (1/1) ... [2019-09-08 08:21:25,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:21:25,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:21:25,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:21:25,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:21:25,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (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 08:21:25,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:21:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:21:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:21:25,719 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:21:25,720 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:21:25,720 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 08:21:25,720 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:21:25,721 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:21:25,721 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:21:25,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:21:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:21:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:21:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:21:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:21:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:21:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:21:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:21:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:21:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:21:25,726 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:21:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:21:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 08:21:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:21:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:21:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:21:25,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:21:25,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:21:27,276 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:21:27,277 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:21:27,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:21:27 BoogieIcfgContainer [2019-09-08 08:21:27,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:21:27,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:21:27,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:21:27,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:21:27,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:21:24" (1/3) ... [2019-09-08 08:21:27,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404c2582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:21:27, skipping insertion in model container [2019-09-08 08:21:27,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:21:25" (2/3) ... [2019-09-08 08:21:27,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404c2582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:21:27, skipping insertion in model container [2019-09-08 08:21:27,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:21:27" (3/3) ... [2019-09-08 08:21:27,291 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:21:27,302 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:21:27,315 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:21:27,333 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:21:27,392 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:21:27,393 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:21:27,393 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:21:27,393 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:21:27,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:21:27,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:21:27,394 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:21:27,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:21:27,394 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:21:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states. [2019-09-08 08:21:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 08:21:27,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:27,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:21:27,443 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash -289186562, now seen corresponding path program 1 times [2019-09-08 08:21:27,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:27,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:27,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:27,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:28,084 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 08:21:28,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:28,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:21:28,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:21:28,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:21:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:21:28,112 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 5 states. [2019-09-08 08:21:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:28,310 INFO L93 Difference]: Finished difference Result 499 states and 849 transitions. [2019-09-08 08:21:28,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:21:28,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 08:21:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:28,330 INFO L225 Difference]: With dead ends: 499 [2019-09-08 08:21:28,330 INFO L226 Difference]: Without dead ends: 346 [2019-09-08 08:21:28,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-08 08:21:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2019-09-08 08:21:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-08 08:21:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 555 transitions. [2019-09-08 08:21:28,412 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 555 transitions. Word has length 102 [2019-09-08 08:21:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:28,413 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 555 transitions. [2019-09-08 08:21:28,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:21:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 555 transitions. [2019-09-08 08:21:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 08:21:28,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:28,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:21:28,424 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 954239452, now seen corresponding path program 1 times [2019-09-08 08:21:28,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:28,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:28,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:28,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:28,900 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 08:21:28,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:28,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:21:28,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:21:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:21:28,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:21:28,903 INFO L87 Difference]: Start difference. First operand 346 states and 555 transitions. Second operand 11 states. [2019-09-08 08:21:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:35,515 INFO L93 Difference]: Finished difference Result 1591 states and 2598 transitions. [2019-09-08 08:21:35,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 08:21:35,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-09-08 08:21:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:35,532 INFO L225 Difference]: With dead ends: 1591 [2019-09-08 08:21:35,532 INFO L226 Difference]: Without dead ends: 1447 [2019-09-08 08:21:35,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 08:21:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-09-08 08:21:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1228. [2019-09-08 08:21:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2019-09-08 08:21:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1992 transitions. [2019-09-08 08:21:35,661 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1992 transitions. Word has length 147 [2019-09-08 08:21:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:35,662 INFO L475 AbstractCegarLoop]: Abstraction has 1228 states and 1992 transitions. [2019-09-08 08:21:35,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:21:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1992 transitions. [2019-09-08 08:21:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 08:21:35,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:35,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:21:35,673 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash 790134356, now seen corresponding path program 1 times [2019-09-08 08:21:35,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:35,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:35,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:35,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:21:35,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:35,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:21:35,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:21:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:21:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:35,991 INFO L87 Difference]: Start difference. First operand 1228 states and 1992 transitions. Second operand 6 states. [2019-09-08 08:21:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:38,346 INFO L93 Difference]: Finished difference Result 4106 states and 6668 transitions. [2019-09-08 08:21:38,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:21:38,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-08 08:21:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:38,373 INFO L225 Difference]: With dead ends: 4106 [2019-09-08 08:21:38,374 INFO L226 Difference]: Without dead ends: 3080 [2019-09-08 08:21:38,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:21:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2019-09-08 08:21:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 3065. [2019-09-08 08:21:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2019-09-08 08:21:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4954 transitions. [2019-09-08 08:21:38,558 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4954 transitions. Word has length 148 [2019-09-08 08:21:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:38,560 INFO L475 AbstractCegarLoop]: Abstraction has 3065 states and 4954 transitions. [2019-09-08 08:21:38,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4954 transitions. [2019-09-08 08:21:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 08:21:38,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:38,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:21:38,568 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:38,569 INFO L82 PathProgramCache]: Analyzing trace with hash -53841261, now seen corresponding path program 1 times [2019-09-08 08:21:38,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:38,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:38,859 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 08:21:38,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:38,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:21:38,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:21:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:21:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:38,861 INFO L87 Difference]: Start difference. First operand 3065 states and 4954 transitions. Second operand 6 states. [2019-09-08 08:21:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:41,329 INFO L93 Difference]: Finished difference Result 11294 states and 18228 transitions. [2019-09-08 08:21:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:21:41,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-08 08:21:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:41,378 INFO L225 Difference]: With dead ends: 11294 [2019-09-08 08:21:41,379 INFO L226 Difference]: Without dead ends: 8431 [2019-09-08 08:21:41,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:21:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2019-09-08 08:21:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8401. [2019-09-08 08:21:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8401 states. [2019-09-08 08:21:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8401 states to 8401 states and 13502 transitions. [2019-09-08 08:21:41,785 INFO L78 Accepts]: Start accepts. Automaton has 8401 states and 13502 transitions. Word has length 149 [2019-09-08 08:21:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:41,785 INFO L475 AbstractCegarLoop]: Abstraction has 8401 states and 13502 transitions. [2019-09-08 08:21:41,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 8401 states and 13502 transitions. [2019-09-08 08:21:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 08:21:41,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:41,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:21:41,791 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash -498966549, now seen corresponding path program 1 times [2019-09-08 08:21:41,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:41,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:41,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:41,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:41,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:21:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:21:41,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:21:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:21:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:41,967 INFO L87 Difference]: Start difference. First operand 8401 states and 13502 transitions. Second operand 6 states. [2019-09-08 08:21:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:44,686 INFO L93 Difference]: Finished difference Result 36639 states and 58782 transitions. [2019-09-08 08:21:44,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:21:44,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-08 08:21:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:44,850 INFO L225 Difference]: With dead ends: 36639 [2019-09-08 08:21:44,850 INFO L226 Difference]: Without dead ends: 28440 [2019-09-08 08:21:44,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:21:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28440 states. [2019-09-08 08:21:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28440 to 28352. [2019-09-08 08:21:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28352 states. [2019-09-08 08:21:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28352 states to 28352 states and 45348 transitions. [2019-09-08 08:21:45,955 INFO L78 Accepts]: Start accepts. Automaton has 28352 states and 45348 transitions. Word has length 150 [2019-09-08 08:21:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:45,956 INFO L475 AbstractCegarLoop]: Abstraction has 28352 states and 45348 transitions. [2019-09-08 08:21:45,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28352 states and 45348 transitions. [2019-09-08 08:21:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 08:21:45,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:45,963 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 08:21:45,964 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1464633526, now seen corresponding path program 1 times [2019-09-08 08:21:45,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:45,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:45,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:45,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:45,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:46,212 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 08:21:46,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:46,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:21:46,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:21:46,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:21:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:21:46,214 INFO L87 Difference]: Start difference. First operand 28352 states and 45348 transitions. Second operand 6 states. [2019-09-08 08:21:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:50,122 INFO L93 Difference]: Finished difference Result 149981 states and 240767 transitions. [2019-09-08 08:21:50,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:21:50,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-08 08:21:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:50,878 INFO L225 Difference]: With dead ends: 149981 [2019-09-08 08:21:50,878 INFO L226 Difference]: Without dead ends: 121831 [2019-09-08 08:21:50,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:21:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121831 states. [2019-09-08 08:21:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121831 to 96782. [2019-09-08 08:21:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96782 states. [2019-09-08 08:21:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96782 states to 96782 states and 155270 transitions. [2019-09-08 08:21:56,048 INFO L78 Accepts]: Start accepts. Automaton has 96782 states and 155270 transitions. Word has length 151 [2019-09-08 08:21:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:21:56,049 INFO L475 AbstractCegarLoop]: Abstraction has 96782 states and 155270 transitions. [2019-09-08 08:21:56,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:21:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 96782 states and 155270 transitions. [2019-09-08 08:21:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 08:21:56,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:21:56,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:21:56,057 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:21:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:21:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -611537536, now seen corresponding path program 1 times [2019-09-08 08:21:56,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:21:56,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:21:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:56,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:21:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:21:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:21:56,294 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 08:21:56,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:21:56,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:21:56,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:21:56,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:21:56,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:21:56,298 INFO L87 Difference]: Start difference. First operand 96782 states and 155270 transitions. Second operand 11 states. [2019-09-08 08:22:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:07,545 INFO L93 Difference]: Finished difference Result 166636 states and 267716 transitions. [2019-09-08 08:22:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 08:22:07,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 08:22:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:08,029 INFO L225 Difference]: With dead ends: 166636 [2019-09-08 08:22:08,030 INFO L226 Difference]: Without dead ends: 138789 [2019-09-08 08:22:08,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 08:22:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138789 states. [2019-09-08 08:22:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138789 to 124693. [2019-09-08 08:22:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124693 states. [2019-09-08 08:22:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124693 states to 124693 states and 200154 transitions. [2019-09-08 08:22:13,245 INFO L78 Accepts]: Start accepts. Automaton has 124693 states and 200154 transitions. Word has length 152 [2019-09-08 08:22:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:13,245 INFO L475 AbstractCegarLoop]: Abstraction has 124693 states and 200154 transitions. [2019-09-08 08:22:13,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:22:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 124693 states and 200154 transitions. [2019-09-08 08:22:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 08:22:13,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:13,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:22:13,253 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1279411234, now seen corresponding path program 1 times [2019-09-08 08:22:13,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:13,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:13,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:13,484 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 08:22:13,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:13,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:22:13,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:22:13,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:22:13,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:22:13,486 INFO L87 Difference]: Start difference. First operand 124693 states and 200154 transitions. Second operand 11 states. [2019-09-08 08:22:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:25,224 INFO L93 Difference]: Finished difference Result 232160 states and 373728 transitions. [2019-09-08 08:22:25,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-08 08:22:25,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 08:22:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:25,875 INFO L225 Difference]: With dead ends: 232160 [2019-09-08 08:22:25,876 INFO L226 Difference]: Without dead ends: 176584 [2019-09-08 08:22:26,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 08:22:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176584 states. [2019-09-08 08:22:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176584 to 160057. [2019-09-08 08:22:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160057 states. [2019-09-08 08:22:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160057 states to 160057 states and 257365 transitions. [2019-09-08 08:22:32,817 INFO L78 Accepts]: Start accepts. Automaton has 160057 states and 257365 transitions. Word has length 152 [2019-09-08 08:22:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:32,818 INFO L475 AbstractCegarLoop]: Abstraction has 160057 states and 257365 transitions. [2019-09-08 08:22:32,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:22:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 160057 states and 257365 transitions. [2019-09-08 08:22:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 08:22:32,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:32,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] [2019-09-08 08:22:32,825 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:32,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:32,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1847125688, now seen corresponding path program 1 times [2019-09-08 08:22:32,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:32,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:32,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:32,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:32,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:33,055 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 08:22:33,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:33,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:22:33,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:22:33,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:22:33,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:22:33,056 INFO L87 Difference]: Start difference. First operand 160057 states and 257365 transitions. Second operand 11 states. [2019-09-08 08:22:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:22:45,049 INFO L93 Difference]: Finished difference Result 283256 states and 456067 transitions. [2019-09-08 08:22:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 08:22:45,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 08:22:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:22:45,657 INFO L225 Difference]: With dead ends: 283256 [2019-09-08 08:22:45,657 INFO L226 Difference]: Without dead ends: 205328 [2019-09-08 08:22:45,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=625, Invalid=2567, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 08:22:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205328 states. [2019-09-08 08:22:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205328 to 187255. [2019-09-08 08:22:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187255 states. [2019-09-08 08:22:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187255 states to 187255 states and 301053 transitions. [2019-09-08 08:22:49,965 INFO L78 Accepts]: Start accepts. Automaton has 187255 states and 301053 transitions. Word has length 152 [2019-09-08 08:22:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:22:49,965 INFO L475 AbstractCegarLoop]: Abstraction has 187255 states and 301053 transitions. [2019-09-08 08:22:49,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:22:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 187255 states and 301053 transitions. [2019-09-08 08:22:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 08:22:49,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:22:49,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:22:49,972 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:22:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:22:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash 743647984, now seen corresponding path program 1 times [2019-09-08 08:22:49,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:22:49,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:22:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:49,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:22:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:22:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:22:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:22:50,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:22:50,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:22:50,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:22:50,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:22:50,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:22:50,167 INFO L87 Difference]: Start difference. First operand 187255 states and 301053 transitions. Second operand 11 states. [2019-09-08 08:23:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:03,594 INFO L93 Difference]: Finished difference Result 297726 states and 480820 transitions. [2019-09-08 08:23:03,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 08:23:03,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 08:23:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:04,490 INFO L225 Difference]: With dead ends: 297726 [2019-09-08 08:23:04,490 INFO L226 Difference]: Without dead ends: 239296 [2019-09-08 08:23:04,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 08:23:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239296 states. [2019-09-08 08:23:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239296 to 219165. [2019-09-08 08:23:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219165 states. [2019-09-08 08:23:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219165 states to 219165 states and 353032 transitions. [2019-09-08 08:23:10,060 INFO L78 Accepts]: Start accepts. Automaton has 219165 states and 353032 transitions. Word has length 152 [2019-09-08 08:23:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:10,060 INFO L475 AbstractCegarLoop]: Abstraction has 219165 states and 353032 transitions. [2019-09-08 08:23:10,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:23:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 219165 states and 353032 transitions. [2019-09-08 08:23:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 08:23:10,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:10,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:23:10,065 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1533671314, now seen corresponding path program 1 times [2019-09-08 08:23:10,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:10,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:10,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:10,201 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 08:23:10,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:23:10,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:23:10,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:23:10,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:23:10,202 INFO L87 Difference]: Start difference. First operand 219165 states and 353032 transitions. Second operand 7 states. [2019-09-08 08:23:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:18,671 INFO L93 Difference]: Finished difference Result 418925 states and 676835 transitions. [2019-09-08 08:23:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:23:18,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-08 08:23:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:19,236 INFO L225 Difference]: With dead ends: 418925 [2019-09-08 08:23:19,236 INFO L226 Difference]: Without dead ends: 234438 [2019-09-08 08:23:19,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:23:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234438 states. [2019-09-08 08:23:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234438 to 198645. [2019-09-08 08:23:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198645 states. [2019-09-08 08:23:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198645 states to 198645 states and 321716 transitions. [2019-09-08 08:23:28,457 INFO L78 Accepts]: Start accepts. Automaton has 198645 states and 321716 transitions. Word has length 153 [2019-09-08 08:23:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:23:28,458 INFO L475 AbstractCegarLoop]: Abstraction has 198645 states and 321716 transitions. [2019-09-08 08:23:28,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:23:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 198645 states and 321716 transitions. [2019-09-08 08:23:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 08:23:28,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:23:28,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:23:28,461 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:23:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:23:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash -504312016, now seen corresponding path program 1 times [2019-09-08 08:23:28,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:23:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:23:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:28,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:23:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:23:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:23:29,282 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 08:23:29,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:23:29,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 08:23:29,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 08:23:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 08:23:29,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:23:29,285 INFO L87 Difference]: Start difference. First operand 198645 states and 321716 transitions. Second operand 12 states. [2019-09-08 08:23:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:23:47,069 INFO L93 Difference]: Finished difference Result 573276 states and 934713 transitions. [2019-09-08 08:23:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 08:23:47,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 153 [2019-09-08 08:23:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:23:48,349 INFO L225 Difference]: With dead ends: 573276 [2019-09-08 08:23:48,350 INFO L226 Difference]: Without dead ends: 423674 [2019-09-08 08:23:48,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 08:23:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423674 states. [2019-09-08 08:24:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423674 to 407888. [2019-09-08 08:24:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407888 states. [2019-09-08 08:24:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407888 states to 407888 states and 665669 transitions. [2019-09-08 08:24:07,927 INFO L78 Accepts]: Start accepts. Automaton has 407888 states and 665669 transitions. Word has length 153 [2019-09-08 08:24:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:24:07,927 INFO L475 AbstractCegarLoop]: Abstraction has 407888 states and 665669 transitions. [2019-09-08 08:24:07,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 08:24:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 407888 states and 665669 transitions. [2019-09-08 08:24:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 08:24:07,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:24:07,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:24:07,932 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:24:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:24:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash -559626430, now seen corresponding path program 1 times [2019-09-08 08:24:07,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:24:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:24:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:07,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:24:07,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:24:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:24:08,037 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 08:24:08,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:24:08,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:24:08,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:24:08,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:24:08,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:24:08,039 INFO L87 Difference]: Start difference. First operand 407888 states and 665669 transitions. Second operand 4 states. [2019-09-08 08:24:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:24:41,083 INFO L93 Difference]: Finished difference Result 1427402 states and 2335780 transitions. [2019-09-08 08:24:41,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:24:41,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-08 08:24:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:24:44,225 INFO L225 Difference]: With dead ends: 1427402 [2019-09-08 08:24:44,226 INFO L226 Difference]: Without dead ends: 1019970 [2019-09-08 08:24:44,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:24:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019970 states. [2019-09-08 08:25:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019970 to 1019966. [2019-09-08 08:25:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019966 states. [2019-09-08 08:25:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019966 states to 1019966 states and 1656067 transitions. [2019-09-08 08:25:56,744 INFO L78 Accepts]: Start accepts. Automaton has 1019966 states and 1656067 transitions. Word has length 153 [2019-09-08 08:25:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:25:56,745 INFO L475 AbstractCegarLoop]: Abstraction has 1019966 states and 1656067 transitions. [2019-09-08 08:25:56,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:25:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1019966 states and 1656067 transitions. [2019-09-08 08:25:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 08:25:56,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:25:56,753 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:25:56,753 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:25:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:25:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1885064620, now seen corresponding path program 1 times [2019-09-08 08:25:56,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:25:56,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:25:56,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:56,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:25:56,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:25:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:25:56,978 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 08:25:56,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:25:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:25:56,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:25:56,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:25:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:25:56,979 INFO L87 Difference]: Start difference. First operand 1019966 states and 1656067 transitions. Second operand 5 states. [2019-09-08 08:27:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:27:13,425 INFO L93 Difference]: Finished difference Result 3044443 states and 4997082 transitions. [2019-09-08 08:27:13,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:27:13,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-08 08:27:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:27:22,965 INFO L225 Difference]: With dead ends: 3044443 [2019-09-08 08:27:22,965 INFO L226 Difference]: Without dead ends: 2024493 [2019-09-08 08:27:24,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:27:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024493 states.