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.3.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:11:22,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:11:22,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:11:22,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:11:22,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:11:22,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:11:22,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:11:22,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:11:22,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:11:22,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:11:22,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:11:22,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:11:22,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:11:22,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:11:22,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:11:22,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:11:22,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:11:22,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:11:22,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:11:22,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:11:22,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:11:22,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:11:22,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:11:22,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:11:22,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:11:22,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:11:22,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:11:22,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:11:22,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:11:22,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:11:22,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:11:22,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:11:22,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:11:22,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:11:22,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:11:22,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:11:22,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:11:22,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:11:22,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:11:22,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:11:22,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:11:22,852 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:11:22,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:11:22,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:11:22,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:11:22,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:11:22,875 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:11:22,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:11:22,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:11:22,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:11:22,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:11:22,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:11:22,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:11:22,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:11:22,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:11:22,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:11:22,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:11:22,877 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:11:22,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:11:22,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:11:22,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:11:22,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:11:22,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:11:22,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:11:22,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:11:22,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:11:22,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:11:22,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:11:22,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:11:22,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:11:22,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:11:22,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:11:22,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:11:22,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:11:22,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:11:22,943 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:11:22,944 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2019-09-08 08:11:23,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634503eef/b7845368bc1e496ca616e4ae55a77261/FLAG56200d5b5 [2019-09-08 08:11:23,563 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:11:23,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2019-09-08 08:11:23,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634503eef/b7845368bc1e496ca616e4ae55a77261/FLAG56200d5b5 [2019-09-08 08:11:23,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/634503eef/b7845368bc1e496ca616e4ae55a77261 [2019-09-08 08:11:23,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:11:23,811 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:11:23,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:11:23,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:11:23,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:11:23,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:11:23" (1/1) ... [2019-09-08 08:11:23,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5b9b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:23, skipping insertion in model container [2019-09-08 08:11:23,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:11:23" (1/1) ... [2019-09-08 08:11:23,835 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:11:23,880 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:11:24,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:11:24,307 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:11:24,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:11:24,415 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:11:24,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24 WrapperNode [2019-09-08 08:11:24,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:11:24,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:11:24,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:11:24,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:11:24,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (1/1) ... [2019-09-08 08:11:24,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (1/1) ... [2019-09-08 08:11:24,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (1/1) ... [2019-09-08 08:11:24,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (1/1) ... [2019-09-08 08:11:24,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (1/1) ... [2019-09-08 08:11:24,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (1/1) ... [2019-09-08 08:11:24,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (1/1) ... [2019-09-08 08:11:24,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:11:24,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:11:24,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:11:24,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:11:24,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (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:11:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:11:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:11:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:11:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:11:24,552 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:11:24,552 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:11:24,552 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:11:24,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:11:24,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:11:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:11:24,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:11:24,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:11:24,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:11:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:11:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:11:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:11:24,558 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:11:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:11:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:11:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:11:24,559 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:11:24,560 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:11:24,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:11:24,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:11:24,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:11:25,493 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:11:25,494 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:11:25,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:11:25 BoogieIcfgContainer [2019-09-08 08:11:25,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:11:25,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:11:25,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:11:25,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:11:25,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:11:23" (1/3) ... [2019-09-08 08:11:25,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3506e1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:11:25, skipping insertion in model container [2019-09-08 08:11:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:11:24" (2/3) ... [2019-09-08 08:11:25,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3506e1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:11:25, skipping insertion in model container [2019-09-08 08:11:25,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:11:25" (3/3) ... [2019-09-08 08:11:25,505 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c [2019-09-08 08:11:25,516 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:11:25,523 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:11:25,540 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:11:25,575 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:11:25,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:11:25,576 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:11:25,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:11:25,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:11:25,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:11:25,577 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:11:25,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:11:25,577 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:11:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-09-08 08:11:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 08:11:25,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:25,615 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] [2019-09-08 08:11:25,617 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:25,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1222599780, now seen corresponding path program 1 times [2019-09-08 08:11:25,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:25,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:25,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:25,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:25,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:26,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 08:11:26,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:26,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:11:26,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:11:26,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:11:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:11:26,126 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 5 states. [2019-09-08 08:11:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:26,317 INFO L93 Difference]: Finished difference Result 279 states and 447 transitions. [2019-09-08 08:11:26,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:11:26,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 08:11:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:26,337 INFO L225 Difference]: With dead ends: 279 [2019-09-08 08:11:26,338 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 08:11:26,343 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:11:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 08:11:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-08 08:11:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 08:11:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-09-08 08:11:26,413 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 59 [2019-09-08 08:11:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:26,413 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-09-08 08:11:26,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:11:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2019-09-08 08:11:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 08:11:26,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:26,420 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] [2019-09-08 08:11:26,420 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:26,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1294429502, now seen corresponding path program 1 times [2019-09-08 08:11:26,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:26,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:26,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:26,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:26,773 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:11:26,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:26,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:11:26,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:11:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:11:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:11:26,777 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand 9 states. [2019-09-08 08:11:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:29,920 INFO L93 Difference]: Finished difference Result 1074 states and 1664 transitions. [2019-09-08 08:11:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 08:11:29,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 08:11:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:29,936 INFO L225 Difference]: With dead ends: 1074 [2019-09-08 08:11:29,936 INFO L226 Difference]: Without dead ends: 972 [2019-09-08 08:11:29,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 08:11:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-09-08 08:11:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 664. [2019-09-08 08:11:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-08 08:11:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1017 transitions. [2019-09-08 08:11:30,034 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1017 transitions. Word has length 88 [2019-09-08 08:11:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:30,035 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1017 transitions. [2019-09-08 08:11:30,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:11:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1017 transitions. [2019-09-08 08:11:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 08:11:30,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:30,041 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] [2019-09-08 08:11:30,042 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1877557831, now seen corresponding path program 1 times [2019-09-08 08:11:30,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:30,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:30,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:30,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:30,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:30,222 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:11:30,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:30,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:11:30,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:11:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:11:30,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:11:30,229 INFO L87 Difference]: Start difference. First operand 664 states and 1017 transitions. Second operand 6 states. [2019-09-08 08:11:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:31,456 INFO L93 Difference]: Finished difference Result 1882 states and 2913 transitions. [2019-09-08 08:11:31,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:11:31,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 08:11:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:31,466 INFO L225 Difference]: With dead ends: 1882 [2019-09-08 08:11:31,466 INFO L226 Difference]: Without dead ends: 1284 [2019-09-08 08:11:31,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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:11:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-08 08:11:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 974. [2019-09-08 08:11:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-08 08:11:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1495 transitions. [2019-09-08 08:11:31,550 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1495 transitions. Word has length 89 [2019-09-08 08:11:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:31,551 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1495 transitions. [2019-09-08 08:11:31,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:11:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1495 transitions. [2019-09-08 08:11:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:11:31,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:31,565 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] [2019-09-08 08:11:31,565 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1476602283, now seen corresponding path program 1 times [2019-09-08 08:11:31,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:31,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:31,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:31,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:31,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:31,698 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:11:31,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:31,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:11:31,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:11:31,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:11:31,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:11:31,700 INFO L87 Difference]: Start difference. First operand 974 states and 1495 transitions. Second operand 6 states. [2019-09-08 08:11:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:33,134 INFO L93 Difference]: Finished difference Result 5433 states and 8433 transitions. [2019-09-08 08:11:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:11:33,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 08:11:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:33,180 INFO L225 Difference]: With dead ends: 5433 [2019-09-08 08:11:33,180 INFO L226 Difference]: Without dead ends: 4525 [2019-09-08 08:11:33,189 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:11:33,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2019-09-08 08:11:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4499. [2019-09-08 08:11:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-09-08 08:11:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 6940 transitions. [2019-09-08 08:11:33,440 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 6940 transitions. Word has length 90 [2019-09-08 08:11:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:33,440 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 6940 transitions. [2019-09-08 08:11:33,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:11:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 6940 transitions. [2019-09-08 08:11:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 08:11:33,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:33,443 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] [2019-09-08 08:11:33,444 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1983567120, now seen corresponding path program 1 times [2019-09-08 08:11:33,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:33,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:33,604 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:11:33,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:33,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:11:33,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:11:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:11:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:11:33,607 INFO L87 Difference]: Start difference. First operand 4499 states and 6940 transitions. Second operand 6 states. [2019-09-08 08:11:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:35,387 INFO L93 Difference]: Finished difference Result 23027 states and 35626 transitions. [2019-09-08 08:11:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:11:35,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 08:11:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:35,532 INFO L225 Difference]: With dead ends: 23027 [2019-09-08 08:11:35,533 INFO L226 Difference]: Without dead ends: 18594 [2019-09-08 08:11:35,553 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:11:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18594 states. [2019-09-08 08:11:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18594 to 18508. [2019-09-08 08:11:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-09-08 08:11:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 28504 transitions. [2019-09-08 08:11:36,417 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 28504 transitions. Word has length 91 [2019-09-08 08:11:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:36,419 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 28504 transitions. [2019-09-08 08:11:36,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:11:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 28504 transitions. [2019-09-08 08:11:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 08:11:36,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:36,428 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] [2019-09-08 08:11:36,428 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1312570520, now seen corresponding path program 1 times [2019-09-08 08:11:36,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:36,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:36,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:11:36,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:36,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:11:36,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:11:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:11:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:11:36,556 INFO L87 Difference]: Start difference. First operand 18508 states and 28504 transitions. Second operand 4 states. [2019-09-08 08:11:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:38,885 INFO L93 Difference]: Finished difference Result 65951 states and 102668 transitions. [2019-09-08 08:11:38,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:11:38,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 08:11:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:39,193 INFO L225 Difference]: With dead ends: 65951 [2019-09-08 08:11:39,193 INFO L226 Difference]: Without dead ends: 47509 [2019-09-08 08:11:39,286 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:11:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47509 states. [2019-09-08 08:11:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47509 to 46966. [2019-09-08 08:11:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46966 states. [2019-09-08 08:11:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46966 states to 46966 states and 71832 transitions. [2019-09-08 08:11:41,419 INFO L78 Accepts]: Start accepts. Automaton has 46966 states and 71832 transitions. Word has length 93 [2019-09-08 08:11:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:41,420 INFO L475 AbstractCegarLoop]: Abstraction has 46966 states and 71832 transitions. [2019-09-08 08:11:41,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:11:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 46966 states and 71832 transitions. [2019-09-08 08:11:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 08:11:41,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:41,428 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] [2019-09-08 08:11:41,428 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1035846331, now seen corresponding path program 1 times [2019-09-08 08:11:41,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:41,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:41,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:41,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:41,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:41,613 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:11:41,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:41,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:11:41,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:11:41,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:11:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:11:41,616 INFO L87 Difference]: Start difference. First operand 46966 states and 71832 transitions. Second operand 9 states. [2019-09-08 08:11:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:46,874 INFO L93 Difference]: Finished difference Result 83066 states and 127591 transitions. [2019-09-08 08:11:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 08:11:46,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 08:11:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:47,178 INFO L225 Difference]: With dead ends: 83066 [2019-09-08 08:11:47,178 INFO L226 Difference]: Without dead ends: 64488 [2019-09-08 08:11:47,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 08:11:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64488 states. [2019-09-08 08:11:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64488 to 52708. [2019-09-08 08:11:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52708 states. [2019-09-08 08:11:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52708 states to 52708 states and 80549 transitions. [2019-09-08 08:11:49,132 INFO L78 Accepts]: Start accepts. Automaton has 52708 states and 80549 transitions. Word has length 94 [2019-09-08 08:11:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:49,133 INFO L475 AbstractCegarLoop]: Abstraction has 52708 states and 80549 transitions. [2019-09-08 08:11:49,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:11:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 52708 states and 80549 transitions. [2019-09-08 08:11:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:11:49,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:49,136 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:11:49,136 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:49,137 INFO L82 PathProgramCache]: Analyzing trace with hash -27207661, now seen corresponding path program 1 times [2019-09-08 08:11:49,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:49,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:49,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:49,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:49,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:49,269 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:11:49,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:49,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:11:49,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:11:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:11:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:11:49,271 INFO L87 Difference]: Start difference. First operand 52708 states and 80549 transitions. Second operand 5 states. [2019-09-08 08:11:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:51,671 INFO L93 Difference]: Finished difference Result 156852 states and 243908 transitions. [2019-09-08 08:11:51,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:11:51,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 08:11:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:52,102 INFO L225 Difference]: With dead ends: 156852 [2019-09-08 08:11:52,103 INFO L226 Difference]: Without dead ends: 104158 [2019-09-08 08:11:52,262 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:11:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104158 states. [2019-09-08 08:11:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104158 to 104156. [2019-09-08 08:11:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104156 states. [2019-09-08 08:11:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104156 states to 104156 states and 157113 transitions. [2019-09-08 08:11:58,500 INFO L78 Accepts]: Start accepts. Automaton has 104156 states and 157113 transitions. Word has length 95 [2019-09-08 08:11:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:58,500 INFO L475 AbstractCegarLoop]: Abstraction has 104156 states and 157113 transitions. [2019-09-08 08:11:58,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:11:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 104156 states and 157113 transitions. [2019-09-08 08:11:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:11:58,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:58,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:11:58,506 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:58,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash -400064748, now seen corresponding path program 1 times [2019-09-08 08:11:58,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:58,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:58,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:58,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:58,584 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:11:58,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:58,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:11:58,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:11:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:11:58,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:11:58,586 INFO L87 Difference]: Start difference. First operand 104156 states and 157113 transitions. Second operand 5 states. [2019-09-08 08:12:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:03,673 INFO L93 Difference]: Finished difference Result 247286 states and 378069 transitions. [2019-09-08 08:12:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:12:03,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 08:12:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:04,321 INFO L225 Difference]: With dead ends: 247286 [2019-09-08 08:12:04,321 INFO L226 Difference]: Without dead ends: 176812 [2019-09-08 08:12:04,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:12:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176812 states. [2019-09-08 08:12:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176812 to 175588. [2019-09-08 08:12:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175588 states. [2019-09-08 08:12:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175588 states to 175588 states and 267386 transitions. [2019-09-08 08:12:12,690 INFO L78 Accepts]: Start accepts. Automaton has 175588 states and 267386 transitions. Word has length 95 [2019-09-08 08:12:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:12,690 INFO L475 AbstractCegarLoop]: Abstraction has 175588 states and 267386 transitions. [2019-09-08 08:12:12,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:12:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 175588 states and 267386 transitions. [2019-09-08 08:12:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:12:12,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:12,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:12:12,698 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1101664622, now seen corresponding path program 1 times [2019-09-08 08:12:12,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:12,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:12,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:12,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:12,857 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:12:12,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:12,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 08:12:12,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 08:12:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 08:12:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:12:12,859 INFO L87 Difference]: Start difference. First operand 175588 states and 267386 transitions. Second operand 10 states. [2019-09-08 08:12:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:26,275 INFO L93 Difference]: Finished difference Result 472167 states and 734668 transitions. [2019-09-08 08:12:26,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 08:12:26,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-09-08 08:12:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:28,494 INFO L225 Difference]: With dead ends: 472167 [2019-09-08 08:12:28,495 INFO L226 Difference]: Without dead ends: 328489 [2019-09-08 08:12:28,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 08:12:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328489 states. [2019-09-08 08:12:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328489 to 314191. [2019-09-08 08:12:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314191 states. [2019-09-08 08:12:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314191 states to 314191 states and 481020 transitions. [2019-09-08 08:12:43,344 INFO L78 Accepts]: Start accepts. Automaton has 314191 states and 481020 transitions. Word has length 95 [2019-09-08 08:12:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:43,345 INFO L475 AbstractCegarLoop]: Abstraction has 314191 states and 481020 transitions. [2019-09-08 08:12:43,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 08:12:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 314191 states and 481020 transitions. [2019-09-08 08:12:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:12:43,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:43,351 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] [2019-09-08 08:12:43,351 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:43,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1417757155, now seen corresponding path program 1 times [2019-09-08 08:12:43,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:43,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:43,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:43,467 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:12:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:43,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:12:43,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:12:43,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:12:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:12:43,469 INFO L87 Difference]: Start difference. First operand 314191 states and 481020 transitions. Second operand 5 states. [2019-09-08 08:12:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:57,821 INFO L93 Difference]: Finished difference Result 739416 states and 1136773 transitions. [2019-09-08 08:12:57,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:12:57,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:12:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:59,234 INFO L225 Difference]: With dead ends: 739416 [2019-09-08 08:12:59,234 INFO L226 Difference]: Without dead ends: 425909 [2019-09-08 08:12:59,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:13:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425909 states. [2019-09-08 08:13:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425909 to 413713. [2019-09-08 08:13:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413713 states. [2019-09-08 08:13:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413713 states to 413713 states and 633265 transitions. [2019-09-08 08:13:26,618 INFO L78 Accepts]: Start accepts. Automaton has 413713 states and 633265 transitions. Word has length 96 [2019-09-08 08:13:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:26,619 INFO L475 AbstractCegarLoop]: Abstraction has 413713 states and 633265 transitions. [2019-09-08 08:13:26,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 413713 states and 633265 transitions. [2019-09-08 08:13:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:26,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:26,626 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] [2019-09-08 08:13:26,626 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1118339801, now seen corresponding path program 1 times [2019-09-08 08:13:26,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:26,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:26,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:26,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:26,792 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:13:26,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:26,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:13:26,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:13:26,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:13:26,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:13:26,794 INFO L87 Difference]: Start difference. First operand 413713 states and 633265 transitions. Second operand 11 states. [2019-09-08 08:13:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:46,934 INFO L93 Difference]: Finished difference Result 906918 states and 1428486 transitions. [2019-09-08 08:13:46,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:13:46,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-09-08 08:13:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:49,753 INFO L225 Difference]: With dead ends: 906918 [2019-09-08 08:13:49,753 INFO L226 Difference]: Without dead ends: 548456 [2019-09-08 08:13:50,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:13:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548456 states. [2019-09-08 08:14:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548456 to 454986. [2019-09-08 08:14:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454986 states. [2019-09-08 08:14:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454986 states to 454986 states and 708613 transitions. [2019-09-08 08:14:27,218 INFO L78 Accepts]: Start accepts. Automaton has 454986 states and 708613 transitions. Word has length 96 [2019-09-08 08:14:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:27,219 INFO L475 AbstractCegarLoop]: Abstraction has 454986 states and 708613 transitions. [2019-09-08 08:14:27,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:14:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 454986 states and 708613 transitions. [2019-09-08 08:14:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:14:27,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:27,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:14:27,225 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -883873459, now seen corresponding path program 1 times [2019-09-08 08:14:27,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:27,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:27,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:27,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:27,383 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:14:27,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:27,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:14:27,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:14:27,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:14:27,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:14:27,385 INFO L87 Difference]: Start difference. First operand 454986 states and 708613 transitions. Second operand 11 states. [2019-09-08 08:14:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:52,080 INFO L93 Difference]: Finished difference Result 1014702 states and 1622502 transitions. [2019-09-08 08:14:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:14:52,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-09-08 08:14:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:53,962 INFO L225 Difference]: With dead ends: 1014702 [2019-09-08 08:14:53,962 INFO L226 Difference]: Without dead ends: 616666 [2019-09-08 08:14:55,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:14:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616666 states. [2019-09-08 08:15:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616666 to 449179. [2019-09-08 08:15:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449179 states. [2019-09-08 08:15:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449179 states to 449179 states and 695029 transitions. [2019-09-08 08:15:27,705 INFO L78 Accepts]: Start accepts. Automaton has 449179 states and 695029 transitions. Word has length 96 [2019-09-08 08:15:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:27,705 INFO L475 AbstractCegarLoop]: Abstraction has 449179 states and 695029 transitions. [2019-09-08 08:15:27,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:15:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 449179 states and 695029 transitions. [2019-09-08 08:15:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:15:27,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:27,709 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] [2019-09-08 08:15:27,709 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1696645317, now seen corresponding path program 1 times [2019-09-08 08:15:27,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:27,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:27,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:27,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:27,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:27,750 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:15:27,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:27,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:15:27,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:15:27,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:15:27,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:15:27,752 INFO L87 Difference]: Start difference. First operand 449179 states and 695029 transitions. Second operand 3 states. [2019-09-08 08:15:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:45,132 INFO L93 Difference]: Finished difference Result 671307 states and 1038435 transitions. [2019-09-08 08:15:45,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:15:45,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 08:15:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:46,507 INFO L225 Difference]: With dead ends: 671307 [2019-09-08 08:15:46,507 INFO L226 Difference]: Without dead ends: 449281 [2019-09-08 08:15:46,870 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 08:15:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449281 states. [2019-09-08 08:16:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449281 to 449181. [2019-09-08 08:16:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449181 states. [2019-09-08 08:16:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449181 states to 449181 states and 695031 transitions. [2019-09-08 08:16:12,786 INFO L78 Accepts]: Start accepts. Automaton has 449181 states and 695031 transitions. Word has length 96 [2019-09-08 08:16:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:16:12,786 INFO L475 AbstractCegarLoop]: Abstraction has 449181 states and 695031 transitions. [2019-09-08 08:16:12,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:16:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 449181 states and 695031 transitions. [2019-09-08 08:16:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:16:12,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:16:12,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:16:12,791 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:16:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:16:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546431, now seen corresponding path program 1 times [2019-09-08 08:16:12,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:16:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:16:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:12,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:16:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:16:12,878 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:16:12,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:16:12,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:16:12,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:16:12,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:16:12,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:16:12,879 INFO L87 Difference]: Start difference. First operand 449181 states and 695031 transitions. Second operand 4 states. [2019-09-08 08:16:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:16:32,819 INFO L93 Difference]: Finished difference Result 898342 states and 1390036 transitions. [2019-09-08 08:16:32,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:16:32,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 08:16:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:16:34,273 INFO L225 Difference]: With dead ends: 898342 [2019-09-08 08:16:34,273 INFO L226 Difference]: Without dead ends: 449178 [2019-09-08 08:16:34,902 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 08:16:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449178 states. [2019-09-08 08:16:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449178 to 449178. [2019-09-08 08:16:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449178 states. [2019-09-08 08:17:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449178 states to 449178 states and 695025 transitions. [2019-09-08 08:17:00,883 INFO L78 Accepts]: Start accepts. Automaton has 449178 states and 695025 transitions. Word has length 97 [2019-09-08 08:17:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:17:00,884 INFO L475 AbstractCegarLoop]: Abstraction has 449178 states and 695025 transitions. [2019-09-08 08:17:00,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:17:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 449178 states and 695025 transitions. [2019-09-08 08:17:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:17:00,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:17:00,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:17:00,887 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:17:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:17:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1912897000, now seen corresponding path program 1 times [2019-09-08 08:17:00,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:17:00,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:17:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:00,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:17:00,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:17:00,990 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:17:00,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:17:00,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:17:00,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:17:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:17:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:17:00,992 INFO L87 Difference]: Start difference. First operand 449178 states and 695025 transitions. Second operand 5 states. [2019-09-08 08:17:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:17:27,600 INFO L93 Difference]: Finished difference Result 1120162 states and 1766511 transitions. [2019-09-08 08:17:27,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:17:27,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 08:17:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:17:30,985 INFO L225 Difference]: With dead ends: 1120162 [2019-09-08 08:17:30,986 INFO L226 Difference]: Without dead ends: 671017 [2019-09-08 08:17:31,689 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:17:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671017 states. [2019-09-08 08:18:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671017 to 671015. [2019-09-08 08:18:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671015 states. [2019-09-08 08:18:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671015 states to 671015 states and 1025592 transitions. [2019-09-08 08:18:10,853 INFO L78 Accepts]: Start accepts. Automaton has 671015 states and 1025592 transitions. Word has length 97 [2019-09-08 08:18:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:10,854 INFO L475 AbstractCegarLoop]: Abstraction has 671015 states and 1025592 transitions. [2019-09-08 08:18:10,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 671015 states and 1025592 transitions. [2019-09-08 08:18:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:18:10,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:10,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:18:10,857 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1016547523, now seen corresponding path program 1 times [2019-09-08 08:18:10,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:10,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:10,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:10,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:21,557 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:18:21,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:21,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:18:21,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:18:21,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:18:21,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:18:21,559 INFO L87 Difference]: Start difference. First operand 671015 states and 1025592 transitions. Second operand 6 states. [2019-09-08 08:18:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:40,383 INFO L93 Difference]: Finished difference Result 1262789 states and 1942893 transitions. [2019-09-08 08:18:40,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:18:40,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 08:18:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:42,855 INFO L225 Difference]: With dead ends: 1262789 [2019-09-08 08:18:42,855 INFO L226 Difference]: Without dead ends: 592660 [2019-09-08 08:18:43,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:18:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592660 states. [2019-09-08 08:19:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592660 to 325944. [2019-09-08 08:19:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325944 states. [2019-09-08 08:19:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325944 states to 325944 states and 476042 transitions. [2019-09-08 08:19:11,889 INFO L78 Accepts]: Start accepts. Automaton has 325944 states and 476042 transitions. Word has length 98 [2019-09-08 08:19:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:11,890 INFO L475 AbstractCegarLoop]: Abstraction has 325944 states and 476042 transitions. [2019-09-08 08:19:11,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:19:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 325944 states and 476042 transitions. [2019-09-08 08:19:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:19:11,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:11,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] [2019-09-08 08:19:11,895 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -676450173, now seen corresponding path program 1 times [2019-09-08 08:19:11,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:11,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:11,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:12,020 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:19:12,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:12,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:19:12,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:19:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:19:12,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:19:12,021 INFO L87 Difference]: Start difference. First operand 325944 states and 476042 transitions. Second operand 5 states. [2019-09-08 08:19:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:19:44,270 INFO L93 Difference]: Finished difference Result 957389 states and 1410725 transitions. [2019-09-08 08:19:44,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:19:44,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 08:19:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:19:46,831 INFO L225 Difference]: With dead ends: 957389 [2019-09-08 08:19:46,832 INFO L226 Difference]: Without dead ends: 631483 [2019-09-08 08:19:47,383 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:19:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631483 states. [2019-09-08 08:20:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631483 to 631481. [2019-09-08 08:20:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631481 states. [2019-09-08 08:20:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631481 states to 631481 states and 906037 transitions. [2019-09-08 08:20:15,348 INFO L78 Accepts]: Start accepts. Automaton has 631481 states and 906037 transitions. Word has length 99 [2019-09-08 08:20:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:20:15,349 INFO L475 AbstractCegarLoop]: Abstraction has 631481 states and 906037 transitions. [2019-09-08 08:20:15,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:20:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 631481 states and 906037 transitions. [2019-09-08 08:20:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 08:20:15,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:20:15,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:20:15,355 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:20:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:20:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 196926360, now seen corresponding path program 1 times [2019-09-08 08:20:15,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:20:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:20:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:15,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:20:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:20:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:20:15,454 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:20:15,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:20:15,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:20:15,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:20:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:20:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:20:15,456 INFO L87 Difference]: Start difference. First operand 631481 states and 906037 transitions. Second operand 5 states. [2019-09-08 08:21:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:21:10,353 INFO L93 Difference]: Finished difference Result 1711492 states and 2478885 transitions. [2019-09-08 08:21:10,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:21:10,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 08:21:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:21:14,464 INFO L225 Difference]: With dead ends: 1711492 [2019-09-08 08:21:14,464 INFO L226 Difference]: Without dead ends: 1080088 [2019-09-08 08:21:15,567 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:21:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080088 states.