java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:25:49,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:25:49,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:25:49,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:25:49,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:25:49,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:25:49,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:25:49,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:25:49,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:25:49,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:25:49,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:25:49,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:25:49,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:25:49,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:25:49,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:25:49,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:25:49,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:25:49,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:25:49,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:25:49,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:25:49,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:25:49,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:25:49,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:25:49,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:25:49,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:25:49,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:25:49,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:25:49,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:25:49,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:25:49,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:25:49,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:25:49,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:25:49,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:25:49,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:25:49,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:25:49,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:25:49,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:25:49,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:25:49,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:25:49,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:25:49,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:25:49,729 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 11:25:49,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:25:49,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:25:49,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:25:49,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:25:49,746 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:25:49,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:25:49,746 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:25:49,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:25:49,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:25:49,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:25:49,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:25:49,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:25:49,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:25:49,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:25:49,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:25:49,748 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:25:49,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:25:49,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:25:49,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:25:49,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:25:49,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:25:49,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:25:49,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:25:49,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:25:49,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:25:49,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:25:49,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:25:49,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:25:49,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:25:49,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:25:49,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:25:49,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:25:49,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:25:49,797 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:25:49,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:25:49,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51be41627/c517e28eacbc4cd1bac303af76d60f0e/FLAGbf3dd0609 [2019-09-08 11:25:50,373 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:25:50,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:25:50,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51be41627/c517e28eacbc4cd1bac303af76d60f0e/FLAGbf3dd0609 [2019-09-08 11:25:50,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51be41627/c517e28eacbc4cd1bac303af76d60f0e [2019-09-08 11:25:50,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:25:50,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:25:50,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:25:50,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:25:50,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:25:50,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:25:50" (1/1) ... [2019-09-08 11:25:50,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7094935f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:50, skipping insertion in model container [2019-09-08 11:25:50,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:25:50" (1/1) ... [2019-09-08 11:25:50,681 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:25:50,740 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:25:51,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:25:51,147 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:25:51,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:25:51,271 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:25:51,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51 WrapperNode [2019-09-08 11:25:51,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:25:51,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:25:51,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:25:51,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:25:51,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (1/1) ... [2019-09-08 11:25:51,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (1/1) ... [2019-09-08 11:25:51,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (1/1) ... [2019-09-08 11:25:51,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (1/1) ... [2019-09-08 11:25:51,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (1/1) ... [2019-09-08 11:25:51,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (1/1) ... [2019-09-08 11:25:51,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (1/1) ... [2019-09-08 11:25:51,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:25:51,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:25:51,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:25:51,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:25:51,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (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 11:25:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:25:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:25:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:25:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:25:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:25:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:25:51,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:25:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:25:51,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:25:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:25:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:25:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:25:51,453 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:25:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:25:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:25:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:25:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:25:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:25:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:25:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:25:51,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:25:51,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:25:52,251 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:25:52,251 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:25:52,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:25:52 BoogieIcfgContainer [2019-09-08 11:25:52,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:25:52,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:25:52,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:25:52,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:25:52,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:25:50" (1/3) ... [2019-09-08 11:25:52,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40291b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:25:52, skipping insertion in model container [2019-09-08 11:25:52,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:25:51" (2/3) ... [2019-09-08 11:25:52,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40291b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:25:52, skipping insertion in model container [2019-09-08 11:25:52,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:25:52" (3/3) ... [2019-09-08 11:25:52,262 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:25:52,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:25:52,302 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:25:52,326 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:25:52,374 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:25:52,375 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:25:52,375 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:25:52,375 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:25:52,376 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:25:52,376 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:25:52,376 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:25:52,376 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:25:52,377 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:25:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2019-09-08 11:25:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:25:52,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:52,416 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] [2019-09-08 11:25:52,418 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash -56104316, now seen corresponding path program 1 times [2019-09-08 11:25:52,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:52,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:52,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:52,976 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 11:25:52,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:52,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:52,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:53,002 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2019-09-08 11:25:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:53,112 INFO L93 Difference]: Finished difference Result 398 states and 640 transitions. [2019-09-08 11:25:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:53,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 11:25:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:53,144 INFO L225 Difference]: With dead ends: 398 [2019-09-08 11:25:53,144 INFO L226 Difference]: Without dead ends: 268 [2019-09-08 11:25:53,154 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 11:25:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-08 11:25:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-09-08 11:25:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-08 11:25:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2019-09-08 11:25:53,280 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 78 [2019-09-08 11:25:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:53,281 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2019-09-08 11:25:53,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2019-09-08 11:25:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:25:53,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:53,285 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] [2019-09-08 11:25:53,286 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash -30986540, now seen corresponding path program 1 times [2019-09-08 11:25:53,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:53,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:53,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:53,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:53,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:53,444 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 11:25:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:53,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:53,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:53,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:53,448 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand 3 states. [2019-09-08 11:25:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:53,539 INFO L93 Difference]: Finished difference Result 670 states and 1040 transitions. [2019-09-08 11:25:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:53,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:25:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:53,546 INFO L225 Difference]: With dead ends: 670 [2019-09-08 11:25:53,546 INFO L226 Difference]: Without dead ends: 452 [2019-09-08 11:25:53,551 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 11:25:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-08 11:25:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2019-09-08 11:25:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-08 11:25:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 689 transitions. [2019-09-08 11:25:53,612 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 689 transitions. Word has length 79 [2019-09-08 11:25:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:53,613 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 689 transitions. [2019-09-08 11:25:53,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 689 transitions. [2019-09-08 11:25:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:25:53,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:53,621 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] [2019-09-08 11:25:53,621 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1869199441, now seen corresponding path program 1 times [2019-09-08 11:25:53,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:53,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:53,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:53,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:53,728 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 11:25:53,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:53,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:53,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:53,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:53,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:53,730 INFO L87 Difference]: Start difference. First operand 450 states and 689 transitions. Second operand 3 states. [2019-09-08 11:25:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:53,781 INFO L93 Difference]: Finished difference Result 1190 states and 1867 transitions. [2019-09-08 11:25:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:53,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:25:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:53,787 INFO L225 Difference]: With dead ends: 1190 [2019-09-08 11:25:53,788 INFO L226 Difference]: Without dead ends: 788 [2019-09-08 11:25:53,790 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 11:25:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-08 11:25:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 786. [2019-09-08 11:25:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-09-08 11:25:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1221 transitions. [2019-09-08 11:25:53,834 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1221 transitions. Word has length 80 [2019-09-08 11:25:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:53,835 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1221 transitions. [2019-09-08 11:25:53,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1221 transitions. [2019-09-08 11:25:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:25:53,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:53,838 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] [2019-09-08 11:25:53,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash -28449079, now seen corresponding path program 1 times [2019-09-08 11:25:53,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:53,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:53,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:53,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:54,022 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 11:25:54,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:54,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:54,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:54,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:54,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:54,024 INFO L87 Difference]: Start difference. First operand 786 states and 1221 transitions. Second operand 3 states. [2019-09-08 11:25:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:54,100 INFO L93 Difference]: Finished difference Result 2134 states and 3359 transitions. [2019-09-08 11:25:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:54,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:25:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:54,116 INFO L225 Difference]: With dead ends: 2134 [2019-09-08 11:25:54,117 INFO L226 Difference]: Without dead ends: 1396 [2019-09-08 11:25:54,119 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 11:25:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-09-08 11:25:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-09-08 11:25:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-08 11:25:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2177 transitions. [2019-09-08 11:25:54,187 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2177 transitions. Word has length 81 [2019-09-08 11:25:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:54,188 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2177 transitions. [2019-09-08 11:25:54,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2177 transitions. [2019-09-08 11:25:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:25:54,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:54,191 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] [2019-09-08 11:25:54,192 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 579558126, now seen corresponding path program 1 times [2019-09-08 11:25:54,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:54,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:54,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:54,309 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 11:25:54,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:54,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:54,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:54,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:54,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:54,311 INFO L87 Difference]: Start difference. First operand 1394 states and 2177 transitions. Second operand 3 states. [2019-09-08 11:25:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:54,431 INFO L93 Difference]: Finished difference Result 3830 states and 6019 transitions. [2019-09-08 11:25:54,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:54,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:25:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:54,446 INFO L225 Difference]: With dead ends: 3830 [2019-09-08 11:25:54,446 INFO L226 Difference]: Without dead ends: 2484 [2019-09-08 11:25:54,450 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 11:25:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2019-09-08 11:25:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2482. [2019-09-08 11:25:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-09-08 11:25:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3873 transitions. [2019-09-08 11:25:54,561 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3873 transitions. Word has length 82 [2019-09-08 11:25:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:54,563 INFO L475 AbstractCegarLoop]: Abstraction has 2482 states and 3873 transitions. [2019-09-08 11:25:54,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3873 transitions. [2019-09-08 11:25:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:25:54,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:54,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] [2019-09-08 11:25:54,565 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1438283986, now seen corresponding path program 1 times [2019-09-08 11:25:54,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:54,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:54,855 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 11:25:54,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:54,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:25:54,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:25:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:25:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:54,857 INFO L87 Difference]: Start difference. First operand 2482 states and 3873 transitions. Second operand 8 states. [2019-09-08 11:25:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:55,728 INFO L93 Difference]: Finished difference Result 15086 states and 23527 transitions. [2019-09-08 11:25:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:25:55,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-08 11:25:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:55,797 INFO L225 Difference]: With dead ends: 15086 [2019-09-08 11:25:55,798 INFO L226 Difference]: Without dead ends: 12652 [2019-09-08 11:25:55,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:25:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12652 states. [2019-09-08 11:25:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12652 to 12642. [2019-09-08 11:25:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12642 states. [2019-09-08 11:25:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12642 states to 12642 states and 19665 transitions. [2019-09-08 11:25:56,686 INFO L78 Accepts]: Start accepts. Automaton has 12642 states and 19665 transitions. Word has length 83 [2019-09-08 11:25:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:56,687 INFO L475 AbstractCegarLoop]: Abstraction has 12642 states and 19665 transitions. [2019-09-08 11:25:56,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:25:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12642 states and 19665 transitions. [2019-09-08 11:25:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:25:56,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:56,689 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] [2019-09-08 11:25:56,689 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:56,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1909068852, now seen corresponding path program 1 times [2019-09-08 11:25:56,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:56,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:56,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:56,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:25:56,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:25:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:25:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:56,757 INFO L87 Difference]: Start difference. First operand 12642 states and 19665 transitions. Second operand 3 states. [2019-09-08 11:25:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:57,758 INFO L93 Difference]: Finished difference Result 34534 states and 53587 transitions. [2019-09-08 11:25:57,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:57,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:25:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:57,849 INFO L225 Difference]: With dead ends: 34534 [2019-09-08 11:25:57,849 INFO L226 Difference]: Without dead ends: 21940 [2019-09-08 11:25:57,877 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 11:25:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21940 states. [2019-09-08 11:25:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21940 to 21938. [2019-09-08 11:25:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21938 states. [2019-09-08 11:25:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21938 states to 21938 states and 33777 transitions. [2019-09-08 11:25:59,430 INFO L78 Accepts]: Start accepts. Automaton has 21938 states and 33777 transitions. Word has length 84 [2019-09-08 11:25:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:59,430 INFO L475 AbstractCegarLoop]: Abstraction has 21938 states and 33777 transitions. [2019-09-08 11:25:59,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 21938 states and 33777 transitions. [2019-09-08 11:25:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:25:59,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:59,432 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] [2019-09-08 11:25:59,433 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2091636891, now seen corresponding path program 1 times [2019-09-08 11:25:59,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:59,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:59,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:59,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:59,536 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 11:25:59,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:25:59,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:25:59,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:25:59,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:25:59,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:25:59,538 INFO L87 Difference]: Start difference. First operand 21938 states and 33777 transitions. Second operand 5 states. [2019-09-08 11:26:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:01,073 INFO L93 Difference]: Finished difference Result 62550 states and 96403 transitions. [2019-09-08 11:26:01,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:26:01,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:26:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:01,192 INFO L225 Difference]: With dead ends: 62550 [2019-09-08 11:26:01,193 INFO L226 Difference]: Without dead ends: 40660 [2019-09-08 11:26:01,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:26:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40660 states. [2019-09-08 11:26:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40660 to 40658. [2019-09-08 11:26:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2019-09-08 11:26:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 62321 transitions. [2019-09-08 11:26:03,999 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 62321 transitions. Word has length 85 [2019-09-08 11:26:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:03,999 INFO L475 AbstractCegarLoop]: Abstraction has 40658 states and 62321 transitions. [2019-09-08 11:26:04,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:26:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 62321 transitions. [2019-09-08 11:26:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:26:04,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:04,001 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] [2019-09-08 11:26:04,002 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:04,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:04,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1934689024, now seen corresponding path program 1 times [2019-09-08 11:26:04,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:04,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:04,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:04,228 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 11:26:04,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:04,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:26:04,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:26:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:26:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:26:04,231 INFO L87 Difference]: Start difference. First operand 40658 states and 62321 transitions. Second operand 8 states. [2019-09-08 11:26:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:12,020 INFO L93 Difference]: Finished difference Result 238048 states and 365432 transitions. [2019-09-08 11:26:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:26:12,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-09-08 11:26:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:12,496 INFO L225 Difference]: With dead ends: 238048 [2019-09-08 11:26:12,497 INFO L226 Difference]: Without dead ends: 197438 [2019-09-08 11:26:12,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:26:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197438 states. [2019-09-08 11:26:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197438 to 81266. [2019-09-08 11:26:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81266 states. [2019-09-08 11:26:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81266 states to 81266 states and 123185 transitions. [2019-09-08 11:26:19,047 INFO L78 Accepts]: Start accepts. Automaton has 81266 states and 123185 transitions. Word has length 85 [2019-09-08 11:26:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:19,047 INFO L475 AbstractCegarLoop]: Abstraction has 81266 states and 123185 transitions. [2019-09-08 11:26:19,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:26:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 81266 states and 123185 transitions. [2019-09-08 11:26:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:26:19,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:19,049 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] [2019-09-08 11:26:19,049 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:19,050 INFO L82 PathProgramCache]: Analyzing trace with hash -172715075, now seen corresponding path program 1 times [2019-09-08 11:26:19,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:19,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:19,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:19,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:19,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:19,141 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 11:26:19,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:19,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:26:19,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:26:19,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:26:19,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:26:19,143 INFO L87 Difference]: Start difference. First operand 81266 states and 123185 transitions. Second operand 5 states. [2019-09-08 11:26:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:26,382 INFO L93 Difference]: Finished difference Result 165300 states and 249138 transitions. [2019-09-08 11:26:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:26:26,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:26:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:26,572 INFO L225 Difference]: With dead ends: 165300 [2019-09-08 11:26:26,572 INFO L226 Difference]: Without dead ends: 165298 [2019-09-08 11:26:26,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 11:26:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165298 states. [2019-09-08 11:26:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165298 to 84082. [2019-09-08 11:26:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84082 states. [2019-09-08 11:26:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84082 states to 84082 states and 126001 transitions. [2019-09-08 11:26:33,764 INFO L78 Accepts]: Start accepts. Automaton has 84082 states and 126001 transitions. Word has length 86 [2019-09-08 11:26:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:33,764 INFO L475 AbstractCegarLoop]: Abstraction has 84082 states and 126001 transitions. [2019-09-08 11:26:33,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:26:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 84082 states and 126001 transitions. [2019-09-08 11:26:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:26:33,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:33,766 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] [2019-09-08 11:26:33,767 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1049580209, now seen corresponding path program 1 times [2019-09-08 11:26:33,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:33,845 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 11:26:33,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:33,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:26:33,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:26:33,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:26:33,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:33,847 INFO L87 Difference]: Start difference. First operand 84082 states and 126001 transitions. Second operand 3 states. [2019-09-08 11:26:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:39,544 INFO L93 Difference]: Finished difference Result 189720 states and 283813 transitions. [2019-09-08 11:26:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:26:39,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-08 11:26:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:39,718 INFO L225 Difference]: With dead ends: 189720 [2019-09-08 11:26:39,718 INFO L226 Difference]: Without dead ends: 105686 [2019-09-08 11:26:39,816 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 11:26:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105686 states. [2019-09-08 11:26:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105686 to 105332. [2019-09-08 11:26:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105332 states. [2019-09-08 11:26:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105332 states to 105332 states and 156803 transitions. [2019-09-08 11:26:48,072 INFO L78 Accepts]: Start accepts. Automaton has 105332 states and 156803 transitions. Word has length 87 [2019-09-08 11:26:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:48,072 INFO L475 AbstractCegarLoop]: Abstraction has 105332 states and 156803 transitions. [2019-09-08 11:26:48,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:26:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 105332 states and 156803 transitions. [2019-09-08 11:26:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 11:26:48,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:48,118 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:48,118 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1906818762, now seen corresponding path program 1 times [2019-09-08 11:26:48,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:48,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:48,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:26:48,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:26:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:48,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 11:26:48,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:26:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:26:48,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:26:48,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 11:26:48,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:26:48,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:26:48,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:26:48,854 INFO L87 Difference]: Start difference. First operand 105332 states and 156803 transitions. Second operand 12 states. [2019-09-08 11:28:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:38,741 INFO L93 Difference]: Finished difference Result 1432024 states and 2111509 transitions. [2019-09-08 11:28:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-08 11:28:38,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-08 11:28:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:41,825 INFO L225 Difference]: With dead ends: 1432024 [2019-09-08 11:28:41,825 INFO L226 Difference]: Without dead ends: 1326742 [2019-09-08 11:28:42,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1653, Invalid=7853, Unknown=0, NotChecked=0, Total=9506 [2019-09-08 11:28:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326742 states. [2019-09-08 11:29:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326742 to 317540. [2019-09-08 11:29:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317540 states. [2019-09-08 11:29:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317540 states to 317540 states and 465603 transitions. [2019-09-08 11:29:27,936 INFO L78 Accepts]: Start accepts. Automaton has 317540 states and 465603 transitions. Word has length 118 [2019-09-08 11:29:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:27,936 INFO L475 AbstractCegarLoop]: Abstraction has 317540 states and 465603 transitions. [2019-09-08 11:29:27,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:29:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 317540 states and 465603 transitions. [2019-09-08 11:29:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 11:29:27,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:27,993 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:27,993 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash -482119262, now seen corresponding path program 1 times [2019-09-08 11:29:27,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:27,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:28,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:28,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:29:28,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:29:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:29:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:28,087 INFO L87 Difference]: Start difference. First operand 317540 states and 465603 transitions. Second operand 3 states. [2019-09-08 11:30:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:30:19,364 INFO L93 Difference]: Finished difference Result 791465 states and 1165191 transitions. [2019-09-08 11:30:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:30:19,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 11:30:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:30:20,275 INFO L225 Difference]: With dead ends: 791465 [2019-09-08 11:30:20,275 INFO L226 Difference]: Without dead ends: 503783 [2019-09-08 11:30:20,580 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 11:30:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503783 states. [2019-09-08 11:31:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503783 to 503781. [2019-09-08 11:31:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503781 states. [2019-09-08 11:31:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503781 states to 503781 states and 737797 transitions. [2019-09-08 11:31:10,679 INFO L78 Accepts]: Start accepts. Automaton has 503781 states and 737797 transitions. Word has length 118 [2019-09-08 11:31:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:10,679 INFO L475 AbstractCegarLoop]: Abstraction has 503781 states and 737797 transitions. [2019-09-08 11:31:10,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:31:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 503781 states and 737797 transitions. [2019-09-08 11:31:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 11:31:10,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:10,736 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:31:10,736 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash -739654471, now seen corresponding path program 1 times [2019-09-08 11:31:10,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:10,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 11:31:10,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:31:10,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:31:10,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:31:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:31:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:31:10,832 INFO L87 Difference]: Start difference. First operand 503781 states and 737797 transitions. Second operand 6 states. [2019-09-08 11:33:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:33:33,943 INFO L93 Difference]: Finished difference Result 1939195 states and 2833240 transitions. [2019-09-08 11:33:33,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:33:33,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-08 11:33:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:33:36,296 INFO L225 Difference]: With dead ends: 1939195 [2019-09-08 11:33:36,296 INFO L226 Difference]: Without dead ends: 1435465 [2019-09-08 11:33:36,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:33:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435465 states. [2019-09-08 11:36:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435465 to 1435461. [2019-09-08 11:36:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435461 states. [2019-09-08 11:36:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435461 states to 1435461 states and 2087397 transitions. [2019-09-08 11:36:42,389 INFO L78 Accepts]: Start accepts. Automaton has 1435461 states and 2087397 transitions. Word has length 118 [2019-09-08 11:36:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:36:42,389 INFO L475 AbstractCegarLoop]: Abstraction has 1435461 states and 2087397 transitions. [2019-09-08 11:36:42,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:36:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1435461 states and 2087397 transitions. [2019-09-08 11:36:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 11:36:42,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:36:42,466 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:36:42,466 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:36:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:36:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2031162782, now seen corresponding path program 1 times [2019-09-08 11:36:42,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:36:42,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:36:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:36:42,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:36:42,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:36:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:36:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:36:42,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:36:42,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)