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.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:44:46,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:44:46,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:44:46,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:44:46,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:44:46,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:44:46,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:44:46,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:44:46,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:44:46,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:44:46,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:44:46,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:44:46,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:44:46,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:44:46,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:44:46,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:44:46,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:44:46,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:44:46,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:44:46,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:44:46,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:44:46,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:44:46,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:44:46,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:44:46,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:44:46,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:44:46,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:44:46,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:44:46,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:44:46,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:44:46,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:44:46,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:44:46,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:44:46,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:44:46,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:44:46,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:44:46,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:44:46,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:44:46,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:44:46,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:44:46,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:44:46,890 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 10:44:46,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:44:46,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:44:46,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:44:46,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:44:46,919 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:44:46,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:44:46,920 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:44:46,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:44:46,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:44:46,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:44:46,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:44:46,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:44:46,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:44:46,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:44:46,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:44:46,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:44:46,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:44:46,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:44:46,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:44:46,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:44:46,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:44:46,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:44:46,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:44:46,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:44:46,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:44:46,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:44:46,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:44:46,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:44:46,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:44:46,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:44:47,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:44:47,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:44:47,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:44:47,014 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:44:47,015 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.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:44:47,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a5e5c2f/437b304b172e4c079bd0b367fe5453e6/FLAG11cca48b8 [2019-09-08 10:44:47,519 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:44:47,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:44:47,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a5e5c2f/437b304b172e4c079bd0b367fe5453e6/FLAG11cca48b8 [2019-09-08 10:44:47,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a5e5c2f/437b304b172e4c079bd0b367fe5453e6 [2019-09-08 10:44:47,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:44:47,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:44:47,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:44:47,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:44:47,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:44:47,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:44:47" (1/1) ... [2019-09-08 10:44:47,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:47, skipping insertion in model container [2019-09-08 10:44:47,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:44:47" (1/1) ... [2019-09-08 10:44:47,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:44:47,980 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:44:48,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:44:48,422 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:44:48,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:44:48,516 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:44:48,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48 WrapperNode [2019-09-08 10:44:48,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:44:48,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:44:48,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:44:48,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:44:48,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... [2019-09-08 10:44:48,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... [2019-09-08 10:44:48,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... [2019-09-08 10:44:48,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... [2019-09-08 10:44:48,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... [2019-09-08 10:44:48,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... [2019-09-08 10:44:48,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... [2019-09-08 10:44:48,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:44:48,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:44:48,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:44:48,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:44:48,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:44:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:44:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:44:48,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:44:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:44:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:44:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:44:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:44:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:44:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:44:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:44:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:44:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:44:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:44:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:44:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:44:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:44:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:44:48,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:44:48,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:44:49,341 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:44:49,341 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:44:49,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:44:49 BoogieIcfgContainer [2019-09-08 10:44:49,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:44:49,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:44:49,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:44:49,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:44:49,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:44:47" (1/3) ... [2019-09-08 10:44:49,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37009ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:44:49, skipping insertion in model container [2019-09-08 10:44:49,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:44:48" (2/3) ... [2019-09-08 10:44:49,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37009ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:44:49, skipping insertion in model container [2019-09-08 10:44:49,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:44:49" (3/3) ... [2019-09-08 10:44:49,352 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:44:49,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:44:49,373 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:44:49,391 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:44:49,423 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:44:49,424 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:44:49,424 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:44:49,424 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:44:49,425 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:44:49,425 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:44:49,425 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:44:49,425 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:44:49,425 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:44:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-09-08 10:44:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 10:44:49,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:49,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:49,463 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 516591794, now seen corresponding path program 1 times [2019-09-08 10:44:49,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:49,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:49,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:49,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:49,868 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 10:44:49,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:49,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:49,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:49,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:49,893 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2019-09-08 10:44:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:49,996 INFO L93 Difference]: Finished difference Result 257 states and 410 transitions. [2019-09-08 10:44:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:50,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 10:44:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:50,012 INFO L225 Difference]: With dead ends: 257 [2019-09-08 10:44:50,013 INFO L226 Difference]: Without dead ends: 170 [2019-09-08 10:44:50,016 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 10:44:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-08 10:44:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-09-08 10:44:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 10:44:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-09-08 10:44:50,108 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 52 [2019-09-08 10:44:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:50,109 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-09-08 10:44:50,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-09-08 10:44:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 10:44:50,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:50,118 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] [2019-09-08 10:44:50,118 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1442159431, now seen corresponding path program 1 times [2019-09-08 10:44:50,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:50,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:50,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:50,373 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 10:44:50,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:50,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:50,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:50,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:50,378 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 3 states. [2019-09-08 10:44:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:50,459 INFO L93 Difference]: Finished difference Result 410 states and 633 transitions. [2019-09-08 10:44:50,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:50,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 10:44:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:50,468 INFO L225 Difference]: With dead ends: 410 [2019-09-08 10:44:50,468 INFO L226 Difference]: Without dead ends: 273 [2019-09-08 10:44:50,473 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 10:44:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-08 10:44:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2019-09-08 10:44:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-08 10:44:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2019-09-08 10:44:50,532 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 52 [2019-09-08 10:44:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:50,533 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2019-09-08 10:44:50,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2019-09-08 10:44:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:44:50,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:50,536 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] [2019-09-08 10:44:50,537 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:50,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash -455539237, now seen corresponding path program 1 times [2019-09-08 10:44:50,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:50,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:50,656 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 10:44:50,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:50,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:50,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:50,659 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 3 states. [2019-09-08 10:44:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:50,719 INFO L93 Difference]: Finished difference Result 687 states and 1070 transitions. [2019-09-08 10:44:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:50,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 10:44:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:50,728 INFO L225 Difference]: With dead ends: 687 [2019-09-08 10:44:50,729 INFO L226 Difference]: Without dead ends: 447 [2019-09-08 10:44:50,732 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 10:44:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-09-08 10:44:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2019-09-08 10:44:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-08 10:44:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 684 transitions. [2019-09-08 10:44:50,794 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 684 transitions. Word has length 53 [2019-09-08 10:44:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:50,796 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 684 transitions. [2019-09-08 10:44:50,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 684 transitions. [2019-09-08 10:44:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:44:50,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:50,801 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] [2019-09-08 10:44:50,802 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 224665030, now seen corresponding path program 1 times [2019-09-08 10:44:50,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:50,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:50,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:50,902 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 10:44:50,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:50,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:50,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:50,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:50,904 INFO L87 Difference]: Start difference. First operand 445 states and 684 transitions. Second operand 3 states. [2019-09-08 10:44:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:50,957 INFO L93 Difference]: Finished difference Result 1145 states and 1782 transitions. [2019-09-08 10:44:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:50,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:44:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:50,962 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 10:44:50,963 INFO L226 Difference]: Without dead ends: 731 [2019-09-08 10:44:50,964 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 10:44:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-08 10:44:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2019-09-08 10:44:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-09-08 10:44:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1120 transitions. [2019-09-08 10:44:51,004 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1120 transitions. Word has length 54 [2019-09-08 10:44:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:51,005 INFO L475 AbstractCegarLoop]: Abstraction has 729 states and 1120 transitions. [2019-09-08 10:44:51,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1120 transitions. [2019-09-08 10:44:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:44:51,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:51,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:51,007 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash -973467484, now seen corresponding path program 1 times [2019-09-08 10:44:51,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:51,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:51,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:51,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:51,111 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 10:44:51,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:51,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:44:51,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:44:51,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:44:51,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:51,113 INFO L87 Difference]: Start difference. First operand 729 states and 1120 transitions. Second operand 6 states. [2019-09-08 10:44:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:51,496 INFO L93 Difference]: Finished difference Result 4219 states and 6565 transitions. [2019-09-08 10:44:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:44:51,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-08 10:44:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:51,524 INFO L225 Difference]: With dead ends: 4219 [2019-09-08 10:44:51,524 INFO L226 Difference]: Without dead ends: 3521 [2019-09-08 10:44:51,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:44:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-09-08 10:44:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 1425. [2019-09-08 10:44:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1425 states. [2019-09-08 10:44:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2176 transitions. [2019-09-08 10:44:51,656 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2176 transitions. Word has length 55 [2019-09-08 10:44:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:51,657 INFO L475 AbstractCegarLoop]: Abstraction has 1425 states and 2176 transitions. [2019-09-08 10:44:51,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:44:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2176 transitions. [2019-09-08 10:44:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:44:51,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:51,660 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] [2019-09-08 10:44:51,660 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:51,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash -131253693, now seen corresponding path program 1 times [2019-09-08 10:44:51,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:51,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:51,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:51,807 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 10:44:51,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:51,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:44:51,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:44:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:44:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:51,809 INFO L87 Difference]: Start difference. First operand 1425 states and 2176 transitions. Second operand 6 states. [2019-09-08 10:44:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:52,274 INFO L93 Difference]: Finished difference Result 6185 states and 9412 transitions. [2019-09-08 10:44:52,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:44:52,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:44:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:52,302 INFO L225 Difference]: With dead ends: 6185 [2019-09-08 10:44:52,302 INFO L226 Difference]: Without dead ends: 4791 [2019-09-08 10:44:52,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:52,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2019-09-08 10:44:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 4785. [2019-09-08 10:44:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4785 states. [2019-09-08 10:44:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 7232 transitions. [2019-09-08 10:44:52,684 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 7232 transitions. Word has length 56 [2019-09-08 10:44:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:52,684 INFO L475 AbstractCegarLoop]: Abstraction has 4785 states and 7232 transitions. [2019-09-08 10:44:52,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:44:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 7232 transitions. [2019-09-08 10:44:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:44:52,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:52,686 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] [2019-09-08 10:44:52,686 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash 394656300, now seen corresponding path program 1 times [2019-09-08 10:44:52,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:52,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:52,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:52,842 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 10:44:52,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:52,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:44:52,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:44:52,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:44:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:44:52,844 INFO L87 Difference]: Start difference. First operand 4785 states and 7232 transitions. Second operand 6 states. [2019-09-08 10:44:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:54,230 INFO L93 Difference]: Finished difference Result 18711 states and 28259 transitions. [2019-09-08 10:44:54,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:44:54,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-08 10:44:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:54,309 INFO L225 Difference]: With dead ends: 18711 [2019-09-08 10:44:54,309 INFO L226 Difference]: Without dead ends: 13957 [2019-09-08 10:44:54,323 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 10:44:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2019-09-08 10:44:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 13953. [2019-09-08 10:44:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13953 states. [2019-09-08 10:44:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13953 states to 13953 states and 20960 transitions. [2019-09-08 10:44:55,429 INFO L78 Accepts]: Start accepts. Automaton has 13953 states and 20960 transitions. Word has length 58 [2019-09-08 10:44:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:55,429 INFO L475 AbstractCegarLoop]: Abstraction has 13953 states and 20960 transitions. [2019-09-08 10:44:55,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:44:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13953 states and 20960 transitions. [2019-09-08 10:44:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:44:55,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:55,431 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] [2019-09-08 10:44:55,431 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash -419755695, now seen corresponding path program 1 times [2019-09-08 10:44:55,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:55,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:55,523 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 10:44:55,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:55,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:44:55,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:44:55,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:44:55,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:44:55,525 INFO L87 Difference]: Start difference. First operand 13953 states and 20960 transitions. Second operand 5 states. [2019-09-08 10:44:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:57,474 INFO L93 Difference]: Finished difference Result 28643 states and 42657 transitions. [2019-09-08 10:44:57,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:44:57,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-08 10:44:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:57,567 INFO L225 Difference]: With dead ends: 28643 [2019-09-08 10:44:57,567 INFO L226 Difference]: Without dead ends: 28641 [2019-09-08 10:44:57,578 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 10:44:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28641 states. [2019-09-08 10:44:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28641 to 14721. [2019-09-08 10:44:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14721 states. [2019-09-08 10:44:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14721 states to 14721 states and 21728 transitions. [2019-09-08 10:44:59,288 INFO L78 Accepts]: Start accepts. Automaton has 14721 states and 21728 transitions. Word has length 58 [2019-09-08 10:44:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:59,288 INFO L475 AbstractCegarLoop]: Abstraction has 14721 states and 21728 transitions. [2019-09-08 10:44:59,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:44:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 14721 states and 21728 transitions. [2019-09-08 10:44:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:44:59,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:59,290 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 10:44:59,290 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:59,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash -117904923, now seen corresponding path program 1 times [2019-09-08 10:44:59,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:59,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:59,377 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 10:44:59,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:59,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:59,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:59,379 INFO L87 Difference]: Start difference. First operand 14721 states and 21728 transitions. Second operand 3 states. [2019-09-08 10:45:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:00,432 INFO L93 Difference]: Finished difference Result 35627 states and 52548 transitions. [2019-09-08 10:45:00,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:00,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:45:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:00,482 INFO L225 Difference]: With dead ends: 35627 [2019-09-08 10:45:00,482 INFO L226 Difference]: Without dead ends: 20937 [2019-09-08 10:45:00,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 10:45:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20937 states. [2019-09-08 10:45:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20937 to 20935. [2019-09-08 10:45:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20935 states. [2019-09-08 10:45:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20935 states to 20935 states and 30682 transitions. [2019-09-08 10:45:01,701 INFO L78 Accepts]: Start accepts. Automaton has 20935 states and 30682 transitions. Word has length 59 [2019-09-08 10:45:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:01,702 INFO L475 AbstractCegarLoop]: Abstraction has 20935 states and 30682 transitions. [2019-09-08 10:45:01,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 20935 states and 30682 transitions. [2019-09-08 10:45:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:45:01,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:01,713 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:45:01,715 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:01,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash 649308805, now seen corresponding path program 1 times [2019-09-08 10:45:01,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:01,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:01,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:45:01,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:45:01,824 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 10:45:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:01,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 10:45:01,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:45:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:45:02,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:45:02,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 10 [2019-09-08 10:45:02,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:45:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:45:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:45:02,165 INFO L87 Difference]: Start difference. First operand 20935 states and 30682 transitions. Second operand 10 states. [2019-09-08 10:45:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:05,493 INFO L93 Difference]: Finished difference Result 52462 states and 77110 transitions. [2019-09-08 10:45:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:45:05,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-08 10:45:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:05,590 INFO L225 Difference]: With dead ends: 52462 [2019-09-08 10:45:05,590 INFO L226 Difference]: Without dead ends: 37772 [2019-09-08 10:45:05,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:45:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37772 states. [2019-09-08 10:45:08,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37772 to 34759. [2019-09-08 10:45:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34759 states. [2019-09-08 10:45:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34759 states to 34759 states and 50650 transitions. [2019-09-08 10:45:08,248 INFO L78 Accepts]: Start accepts. Automaton has 34759 states and 50650 transitions. Word has length 80 [2019-09-08 10:45:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:08,248 INFO L475 AbstractCegarLoop]: Abstraction has 34759 states and 50650 transitions. [2019-09-08 10:45:08,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:45:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 34759 states and 50650 transitions. [2019-09-08 10:45:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:45:08,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:08,257 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:45:08,258 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1922086913, now seen corresponding path program 1 times [2019-09-08 10:45:08,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:08,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:08,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:45:08,358 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:45:08,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:08,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:45:08,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:45:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:08,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:45:08,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:45:08,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:45:08,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:45:08,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:45:08,588 INFO L87 Difference]: Start difference. First operand 34759 states and 50650 transitions. Second operand 11 states. [2019-09-08 10:45:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:14,472 INFO L93 Difference]: Finished difference Result 121077 states and 176426 transitions. [2019-09-08 10:45:14,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:45:14,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-08 10:45:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:14,696 INFO L225 Difference]: With dead ends: 121077 [2019-09-08 10:45:14,696 INFO L226 Difference]: Without dead ends: 95099 [2019-09-08 10:45:14,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:45:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95099 states. [2019-09-08 10:45:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95099 to 48175. [2019-09-08 10:45:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48175 states. [2019-09-08 10:45:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48175 states to 48175 states and 69994 transitions. [2019-09-08 10:45:18,129 INFO L78 Accepts]: Start accepts. Automaton has 48175 states and 69994 transitions. Word has length 81 [2019-09-08 10:45:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:18,130 INFO L475 AbstractCegarLoop]: Abstraction has 48175 states and 69994 transitions. [2019-09-08 10:45:18,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:45:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 48175 states and 69994 transitions. [2019-09-08 10:45:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:45:18,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:18,140 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:45:18,140 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash 443636064, now seen corresponding path program 1 times [2019-09-08 10:45:18,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:18,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:18,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:18,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:18,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:18,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:18,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:18,209 INFO L87 Difference]: Start difference. First operand 48175 states and 69994 transitions. Second operand 3 states. [2019-09-08 10:45:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:22,746 INFO L93 Difference]: Finished difference Result 94537 states and 137056 transitions. [2019-09-08 10:45:22,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:22,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 10:45:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:22,872 INFO L225 Difference]: With dead ends: 94537 [2019-09-08 10:45:22,872 INFO L226 Difference]: Without dead ends: 66823 [2019-09-08 10:45:22,921 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 10:45:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66823 states. [2019-09-08 10:45:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66823 to 62417. [2019-09-08 10:45:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62417 states. [2019-09-08 10:45:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62417 states to 62417 states and 89566 transitions. [2019-09-08 10:45:26,722 INFO L78 Accepts]: Start accepts. Automaton has 62417 states and 89566 transitions. Word has length 81 [2019-09-08 10:45:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:26,722 INFO L475 AbstractCegarLoop]: Abstraction has 62417 states and 89566 transitions. [2019-09-08 10:45:26,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 62417 states and 89566 transitions. [2019-09-08 10:45:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:45:26,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:26,732 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:45:26,732 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash -43199767, now seen corresponding path program 1 times [2019-09-08 10:45:26,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:26,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:26,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:26,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:26,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:26,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:26,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:26,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:26,791 INFO L87 Difference]: Start difference. First operand 62417 states and 89566 transitions. Second operand 3 states. [2019-09-08 10:45:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:32,550 INFO L93 Difference]: Finished difference Result 98925 states and 141263 transitions. [2019-09-08 10:45:32,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:32,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 10:45:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:32,631 INFO L225 Difference]: With dead ends: 98925 [2019-09-08 10:45:32,632 INFO L226 Difference]: Without dead ends: 65502 [2019-09-08 10:45:32,672 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 10:45:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65502 states. [2019-09-08 10:45:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65502 to 62590. [2019-09-08 10:45:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62590 states. [2019-09-08 10:45:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62590 states to 62590 states and 88374 transitions. [2019-09-08 10:45:36,293 INFO L78 Accepts]: Start accepts. Automaton has 62590 states and 88374 transitions. Word has length 81 [2019-09-08 10:45:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:36,293 INFO L475 AbstractCegarLoop]: Abstraction has 62590 states and 88374 transitions. [2019-09-08 10:45:36,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62590 states and 88374 transitions. [2019-09-08 10:45:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:45:36,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:36,302 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:45:36,303 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:36,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:36,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1478695732, now seen corresponding path program 1 times [2019-09-08 10:45:36,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:36,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:36,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:36,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:36,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:36,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:36,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:36,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:36,364 INFO L87 Difference]: Start difference. First operand 62590 states and 88374 transitions. Second operand 3 states. [2019-09-08 10:45:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:42,786 INFO L93 Difference]: Finished difference Result 139247 states and 196562 transitions. [2019-09-08 10:45:42,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:42,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 10:45:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:42,908 INFO L225 Difference]: With dead ends: 139247 [2019-09-08 10:45:42,908 INFO L226 Difference]: Without dead ends: 84537 [2019-09-08 10:45:42,963 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 10:45:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84537 states. [2019-09-08 10:45:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84537 to 84340. [2019-09-08 10:45:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84340 states. [2019-09-08 10:45:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84340 states to 84340 states and 117960 transitions. [2019-09-08 10:45:47,754 INFO L78 Accepts]: Start accepts. Automaton has 84340 states and 117960 transitions. Word has length 81 [2019-09-08 10:45:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:47,754 INFO L475 AbstractCegarLoop]: Abstraction has 84340 states and 117960 transitions. [2019-09-08 10:45:47,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 84340 states and 117960 transitions. [2019-09-08 10:45:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:45:47,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:47,765 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:45:47,765 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:47,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1706021239, now seen corresponding path program 1 times [2019-09-08 10:45:47,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:47,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:47,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 10:45:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:47,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:45:47,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:45:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:45:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:45:47,849 INFO L87 Difference]: Start difference. First operand 84340 states and 117960 transitions. Second operand 6 states. [2019-09-08 10:46:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:02,274 INFO L93 Difference]: Finished difference Result 295820 states and 412201 transitions. [2019-09-08 10:46:02,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:46:02,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-08 10:46:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:02,581 INFO L225 Difference]: With dead ends: 295820 [2019-09-08 10:46:02,582 INFO L226 Difference]: Without dead ends: 211573 [2019-09-08 10:46:02,661 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 10:46:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211573 states. [2019-09-08 10:46:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211573 to 208229. [2019-09-08 10:46:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208229 states. [2019-09-08 10:46:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208229 states to 208229 states and 289208 transitions. [2019-09-08 10:46:20,465 INFO L78 Accepts]: Start accepts. Automaton has 208229 states and 289208 transitions. Word has length 81 [2019-09-08 10:46:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:20,465 INFO L475 AbstractCegarLoop]: Abstraction has 208229 states and 289208 transitions. [2019-09-08 10:46:20,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:46:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 208229 states and 289208 transitions. [2019-09-08 10:46:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:46:20,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:20,477 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:46:20,477 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:20,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash -683720356, now seen corresponding path program 1 times [2019-09-08 10:46:20,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:20,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:20,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:20,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:20,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:20,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:46:20,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 10:46:20,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:46:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:21,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:46:21,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:46:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:21,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:46:21,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:46:21,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:46:21,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:46:21,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:46:21,273 INFO L87 Difference]: Start difference. First operand 208229 states and 289208 transitions. Second operand 11 states. [2019-09-08 10:46:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:54,207 INFO L93 Difference]: Finished difference Result 556485 states and 773306 transitions. [2019-09-08 10:46:54,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:46:54,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-08 10:46:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:55,558 INFO L225 Difference]: With dead ends: 556485 [2019-09-08 10:46:55,559 INFO L226 Difference]: Without dead ends: 426794 [2019-09-08 10:46:55,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:46:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426794 states. [2019-09-08 10:47:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426794 to 233517. [2019-09-08 10:47:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233517 states. [2019-09-08 10:47:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233517 states to 233517 states and 324726 transitions. [2019-09-08 10:47:24,054 INFO L78 Accepts]: Start accepts. Automaton has 233517 states and 324726 transitions. Word has length 81 [2019-09-08 10:47:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:24,054 INFO L475 AbstractCegarLoop]: Abstraction has 233517 states and 324726 transitions. [2019-09-08 10:47:24,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:47:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 233517 states and 324726 transitions. [2019-09-08 10:47:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:47:24,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:24,066 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:47:24,067 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:24,067 INFO L82 PathProgramCache]: Analyzing trace with hash -518806098, now seen corresponding path program 1 times [2019-09-08 10:47:24,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:24,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:24,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:47:24,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:24,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:47:24,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:47:24,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:47:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:47:24,145 INFO L87 Difference]: Start difference. First operand 233517 states and 324726 transitions. Second operand 6 states. [2019-09-08 10:48:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:14,712 INFO L93 Difference]: Finished difference Result 818785 states and 1134601 transitions. [2019-09-08 10:48:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:14,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-08 10:48:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:15,761 INFO L225 Difference]: With dead ends: 818785 [2019-09-08 10:48:15,762 INFO L226 Difference]: Without dead ends: 585415 [2019-09-08 10:48:15,990 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 10:48:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585415 states. [2019-09-08 10:49:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585415 to 576477. [2019-09-08 10:49:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576477 states. [2019-09-08 10:49:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576477 states to 576477 states and 796274 transitions. [2019-09-08 10:49:19,860 INFO L78 Accepts]: Start accepts. Automaton has 576477 states and 796274 transitions. Word has length 81 [2019-09-08 10:49:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:19,861 INFO L475 AbstractCegarLoop]: Abstraction has 576477 states and 796274 transitions. [2019-09-08 10:49:19,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:49:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 576477 states and 796274 transitions. [2019-09-08 10:49:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:49:19,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:19,874 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:49:19,874 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1000151721, now seen corresponding path program 1 times [2019-09-08 10:49:19,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:19,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:19,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:19,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:19,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:49:19,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:49:19,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:20,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:49:20,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:49:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:49:20,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:49:20,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:49:20,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:49:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:49:20,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:49:20,157 INFO L87 Difference]: Start difference. First operand 576477 states and 796274 transitions. Second operand 11 states. [2019-09-08 10:50:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:56,651 INFO L93 Difference]: Finished difference Result 1115958 states and 1531282 transitions. [2019-09-08 10:50:56,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:50:56,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-08 10:50:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:58,321 INFO L225 Difference]: With dead ends: 1115958 [2019-09-08 10:50:58,321 INFO L226 Difference]: Without dead ends: 907172 [2019-09-08 10:50:58,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:50:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907172 states. [2019-09-08 10:52:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907172 to 603549. [2019-09-08 10:52:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603549 states. [2019-09-08 10:52:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603549 states to 603549 states and 831905 transitions. [2019-09-08 10:52:21,227 INFO L78 Accepts]: Start accepts. Automaton has 603549 states and 831905 transitions. Word has length 81 [2019-09-08 10:52:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:21,227 INFO L475 AbstractCegarLoop]: Abstraction has 603549 states and 831905 transitions. [2019-09-08 10:52:21,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:52:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 603549 states and 831905 transitions. [2019-09-08 10:52:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:52:21,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:21,243 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:52:21,243 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1202626396, now seen corresponding path program 1 times [2019-09-08 10:52:21,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:21,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:21,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:21,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:21,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:21,291 INFO L87 Difference]: Start difference. First operand 603549 states and 831905 transitions. Second operand 3 states. [2019-09-08 10:53:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:52,451 INFO L93 Difference]: Finished difference Result 1275684 states and 1754044 transitions. [2019-09-08 10:53:52,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:53:52,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:53:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:53,837 INFO L225 Difference]: With dead ends: 1275684 [2019-09-08 10:53:53,837 INFO L226 Difference]: Without dead ends: 731339 [2019-09-08 10:53:54,250 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 10:53:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731339 states. [2019-09-08 10:55:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731339 to 692093. [2019-09-08 10:55:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692093 states. [2019-09-08 10:55:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692093 states to 692093 states and 935284 transitions. [2019-09-08 10:55:16,512 INFO L78 Accepts]: Start accepts. Automaton has 692093 states and 935284 transitions. Word has length 82 [2019-09-08 10:55:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:16,512 INFO L475 AbstractCegarLoop]: Abstraction has 692093 states and 935284 transitions. [2019-09-08 10:55:16,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:55:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 692093 states and 935284 transitions. [2019-09-08 10:55:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:55:16,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:16,531 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:55:16,531 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:16,531 INFO L82 PathProgramCache]: Analyzing trace with hash -308441745, now seen corresponding path program 1 times [2019-09-08 10:55:16,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:16,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:16,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:16,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 10:55:16,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:16,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:55:16,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:55:16,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:55:16,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:55:16,590 INFO L87 Difference]: Start difference. First operand 692093 states and 935284 transitions. Second operand 5 states.