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.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:56:13,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:56:13,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:56:13,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:56:13,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:56:13,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:56:13,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:56:13,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:56:13,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:56:13,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:56:13,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:56:13,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:56:13,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:56:13,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:56:13,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:56:13,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:56:13,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:56:13,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:56:13,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:56:13,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:56:13,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:56:13,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:56:13,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:56:13,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:56:13,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:56:13,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:56:13,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:56:13,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:56:13,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:56:13,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:56:13,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:56:13,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:56:13,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:56:13,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:56:13,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:56:13,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:56:13,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:56:13,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:56:13,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:56:13,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:56:13,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:56:13,822 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-10-02 14:56:13,851 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:56:13,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:56:13,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:56:13,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:56:13,854 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:56:13,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:56:13,855 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:56:13,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:56:13,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:56:13,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:56:13,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:56:13,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:56:13,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:56:13,858 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:56:13,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:56:13,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:56:13,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:56:13,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:56:13,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:56:13,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:56:13,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:56:13,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:56:13,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:56:13,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:56:13,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:56:13,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:56:13,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:56:13,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:56:13,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:56:13,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:56:13,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:56:13,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:56:13,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:56:13,919 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:56:13,920 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.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-02 14:56:13,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4d300db/dbe2f7783868451083cca05cd2e408ee/FLAG60e9efbc6 [2019-10-02 14:56:14,737 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:56:14,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-02 14:56:14,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4d300db/dbe2f7783868451083cca05cd2e408ee/FLAG60e9efbc6 [2019-10-02 14:56:14,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4d300db/dbe2f7783868451083cca05cd2e408ee [2019-10-02 14:56:14,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:56:14,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:56:14,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:56:14,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:56:14,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:56:14,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:56:14" (1/1) ... [2019-10-02 14:56:14,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9b1f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:14, skipping insertion in model container [2019-10-02 14:56:14,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:56:14" (1/1) ... [2019-10-02 14:56:14,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:56:15,083 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:56:16,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:56:16,216 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:56:16,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:56:16,640 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:56:16,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16 WrapperNode [2019-10-02 14:56:16,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:56:16,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:56:16,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:56:16,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:56:16,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (1/1) ... [2019-10-02 14:56:16,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (1/1) ... [2019-10-02 14:56:16,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (1/1) ... [2019-10-02 14:56:16,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (1/1) ... [2019-10-02 14:56:16,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (1/1) ... [2019-10-02 14:56:16,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (1/1) ... [2019-10-02 14:56:16,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (1/1) ... [2019-10-02 14:56:16,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:56:16,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:56:16,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:56:16,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:56:16,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (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-10-02 14:56:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:56:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:56:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:56:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:56:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:56:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:56:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:56:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:56:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:56:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:56:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:56:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:56:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:56:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:56:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:56:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:56:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:56:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:56:20,808 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:56:20,809 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:56:20,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:56:20 BoogieIcfgContainer [2019-10-02 14:56:20,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:56:20,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:56:20,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:56:20,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:56:20,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:56:14" (1/3) ... [2019-10-02 14:56:20,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a10b645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:56:20, skipping insertion in model container [2019-10-02 14:56:20,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:56:16" (2/3) ... [2019-10-02 14:56:20,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a10b645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:56:20, skipping insertion in model container [2019-10-02 14:56:20,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:56:20" (3/3) ... [2019-10-02 14:56:20,821 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-02 14:56:20,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:56:20,842 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-02 14:56:20,860 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-02 14:56:20,903 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:56:20,904 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:56:20,904 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:56:20,905 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:56:20,905 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:56:20,905 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:56:20,905 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:56:20,905 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:56:20,905 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:56:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states. [2019-10-02 14:56:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:20,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:20,975 INFO L411 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-10-02 14:56:20,978 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1212138476, now seen corresponding path program 1 times [2019-10-02 14:56:20,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:20,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:21,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:21,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:21,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:56:21,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:56:21,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:56:21,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:56:21,654 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 6 states. [2019-10-02 14:56:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:23,842 INFO L93 Difference]: Finished difference Result 2390 states and 4093 transitions. [2019-10-02 14:56:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:23,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 14:56:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:23,893 INFO L225 Difference]: With dead ends: 2390 [2019-10-02 14:56:23,893 INFO L226 Difference]: Without dead ends: 1617 [2019-10-02 14:56:23,910 INFO L640 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-10-02 14:56:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-10-02 14:56:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1594. [2019-10-02 14:56:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-10-02 14:56:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2070 transitions. [2019-10-02 14:56:24,156 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2070 transitions. Word has length 56 [2019-10-02 14:56:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:24,157 INFO L475 AbstractCegarLoop]: Abstraction has 1594 states and 2070 transitions. [2019-10-02 14:56:24,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:56:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2070 transitions. [2019-10-02 14:56:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:24,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:24,172 INFO L411 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-10-02 14:56:24,173 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1633149148, now seen corresponding path program 1 times [2019-10-02 14:56:24,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:24,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:24,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:24,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:24,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:56:24,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:56:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:56:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:56:24,484 INFO L87 Difference]: Start difference. First operand 1594 states and 2070 transitions. Second operand 6 states. [2019-10-02 14:56:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:25,827 INFO L93 Difference]: Finished difference Result 3490 states and 4654 transitions. [2019-10-02 14:56:25,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:25,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 14:56:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:25,841 INFO L225 Difference]: With dead ends: 3490 [2019-10-02 14:56:25,842 INFO L226 Difference]: Without dead ends: 2530 [2019-10-02 14:56:25,846 INFO L640 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-10-02 14:56:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-10-02 14:56:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2514. [2019-10-02 14:56:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-10-02 14:56:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3354 transitions. [2019-10-02 14:56:25,963 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3354 transitions. Word has length 56 [2019-10-02 14:56:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:25,964 INFO L475 AbstractCegarLoop]: Abstraction has 2514 states and 3354 transitions. [2019-10-02 14:56:25,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:56:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3354 transitions. [2019-10-02 14:56:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:56:25,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:25,969 INFO L411 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-10-02 14:56:25,969 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash -755922083, now seen corresponding path program 1 times [2019-10-02 14:56:25,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:25,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:25,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:26,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:26,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:56:26,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:56:26,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:56:26,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:56:26,139 INFO L87 Difference]: Start difference. First operand 2514 states and 3354 transitions. Second operand 5 states. [2019-10-02 14:56:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:27,435 INFO L93 Difference]: Finished difference Result 5219 states and 7042 transitions. [2019-10-02 14:56:27,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:56:27,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-02 14:56:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:27,461 INFO L225 Difference]: With dead ends: 5219 [2019-10-02 14:56:27,462 INFO L226 Difference]: Without dead ends: 3904 [2019-10-02 14:56:27,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:56:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-10-02 14:56:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3898. [2019-10-02 14:56:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-02 14:56:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5174 transitions. [2019-10-02 14:56:27,693 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5174 transitions. Word has length 56 [2019-10-02 14:56:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:27,696 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5174 transitions. [2019-10-02 14:56:27,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:56:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5174 transitions. [2019-10-02 14:56:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:27,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:27,702 INFO L411 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-10-02 14:56:27,702 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash -418972447, now seen corresponding path program 1 times [2019-10-02 14:56:27,703 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:27,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:27,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:28,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:28,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:56:28,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:56:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:56:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:56:28,033 INFO L87 Difference]: Start difference. First operand 3898 states and 5174 transitions. Second operand 8 states. [2019-10-02 14:56:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:30,646 INFO L93 Difference]: Finished difference Result 8917 states and 12719 transitions. [2019-10-02 14:56:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:56:30,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-02 14:56:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:30,685 INFO L225 Difference]: With dead ends: 8917 [2019-10-02 14:56:30,685 INFO L226 Difference]: Without dead ends: 7575 [2019-10-02 14:56:30,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:56:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7575 states. [2019-10-02 14:56:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7575 to 3898. [2019-10-02 14:56:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-02 14:56:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5173 transitions. [2019-10-02 14:56:30,990 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5173 transitions. Word has length 58 [2019-10-02 14:56:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:30,990 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5173 transitions. [2019-10-02 14:56:30,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:56:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5173 transitions. [2019-10-02 14:56:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:30,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:30,995 INFO L411 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-10-02 14:56:30,996 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:30,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:30,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1952539007, now seen corresponding path program 1 times [2019-10-02 14:56:30,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:30,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:31,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:31,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:31,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:31,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:31,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:31,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:31,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:31,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:31,303 INFO L87 Difference]: Start difference. First operand 3898 states and 5173 transitions. Second operand 9 states. [2019-10-02 14:56:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:34,702 INFO L93 Difference]: Finished difference Result 8308 states and 11719 transitions. [2019-10-02 14:56:34,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:56:34,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 14:56:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:34,745 INFO L225 Difference]: With dead ends: 8308 [2019-10-02 14:56:34,745 INFO L226 Difference]: Without dead ends: 8302 [2019-10-02 14:56:34,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:56:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-10-02 14:56:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 3898. [2019-10-02 14:56:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-02 14:56:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5172 transitions. [2019-10-02 14:56:35,148 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5172 transitions. Word has length 58 [2019-10-02 14:56:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:35,149 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5172 transitions. [2019-10-02 14:56:35,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5172 transitions. [2019-10-02 14:56:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:35,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:35,154 INFO L411 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-10-02 14:56:35,155 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:35,155 INFO L82 PathProgramCache]: Analyzing trace with hash -215970595, now seen corresponding path program 1 times [2019-10-02 14:56:35,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:35,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:35,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:35,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:35,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:35,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:35,414 INFO L87 Difference]: Start difference. First operand 3898 states and 5172 transitions. Second operand 9 states. [2019-10-02 14:56:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:39,181 INFO L93 Difference]: Finished difference Result 10341 states and 14551 transitions. [2019-10-02 14:56:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:56:39,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 14:56:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:39,243 INFO L225 Difference]: With dead ends: 10341 [2019-10-02 14:56:39,243 INFO L226 Difference]: Without dead ends: 9285 [2019-10-02 14:56:39,249 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:56:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2019-10-02 14:56:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 3898. [2019-10-02 14:56:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-02 14:56:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5171 transitions. [2019-10-02 14:56:39,584 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5171 transitions. Word has length 58 [2019-10-02 14:56:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:39,585 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5171 transitions. [2019-10-02 14:56:39,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5171 transitions. [2019-10-02 14:56:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:39,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:39,591 INFO L411 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-10-02 14:56:39,591 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash 834918715, now seen corresponding path program 1 times [2019-10-02 14:56:39,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:39,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:39,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:39,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:39,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:39,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:39,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:39,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:39,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:39,707 INFO L87 Difference]: Start difference. First operand 3898 states and 5171 transitions. Second operand 3 states. [2019-10-02 14:56:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:40,289 INFO L93 Difference]: Finished difference Result 5770 states and 8000 transitions. [2019-10-02 14:56:40,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:40,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:40,303 INFO L225 Difference]: With dead ends: 5770 [2019-10-02 14:56:40,304 INFO L226 Difference]: Without dead ends: 4287 [2019-10-02 14:56:40,308 INFO L640 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-10-02 14:56:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-10-02 14:56:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3971. [2019-10-02 14:56:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-10-02 14:56:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5314 transitions. [2019-10-02 14:56:40,644 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5314 transitions. Word has length 59 [2019-10-02 14:56:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:40,647 INFO L475 AbstractCegarLoop]: Abstraction has 3971 states and 5314 transitions. [2019-10-02 14:56:40,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5314 transitions. [2019-10-02 14:56:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:40,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:40,653 INFO L411 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-10-02 14:56:40,653 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 132280932, now seen corresponding path program 1 times [2019-10-02 14:56:40,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:40,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:40,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:40,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:40,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:40,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:40,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:40,757 INFO L87 Difference]: Start difference. First operand 3971 states and 5314 transitions. Second operand 3 states. [2019-10-02 14:56:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:41,216 INFO L93 Difference]: Finished difference Result 6729 states and 9451 transitions. [2019-10-02 14:56:41,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:41,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:41,227 INFO L225 Difference]: With dead ends: 6729 [2019-10-02 14:56:41,228 INFO L226 Difference]: Without dead ends: 4943 [2019-10-02 14:56:41,234 INFO L640 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-10-02 14:56:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-10-02 14:56:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4463. [2019-10-02 14:56:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4463 states. [2019-10-02 14:56:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 6066 transitions. [2019-10-02 14:56:41,725 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 6066 transitions. Word has length 59 [2019-10-02 14:56:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:41,725 INFO L475 AbstractCegarLoop]: Abstraction has 4463 states and 6066 transitions. [2019-10-02 14:56:41,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 6066 transitions. [2019-10-02 14:56:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:41,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:41,730 INFO L411 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-10-02 14:56:41,730 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1642469980, now seen corresponding path program 1 times [2019-10-02 14:56:41,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:41,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:41,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:41,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:41,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:41,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:41,850 INFO L87 Difference]: Start difference. First operand 4463 states and 6066 transitions. Second operand 3 states. [2019-10-02 14:56:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:42,436 INFO L93 Difference]: Finished difference Result 8919 states and 12582 transitions. [2019-10-02 14:56:42,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:42,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:42,451 INFO L225 Difference]: With dead ends: 8919 [2019-10-02 14:56:42,451 INFO L226 Difference]: Without dead ends: 5699 [2019-10-02 14:56:42,460 INFO L640 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-10-02 14:56:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-10-02 14:56:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5697. [2019-10-02 14:56:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-10-02 14:56:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7848 transitions. [2019-10-02 14:56:43,138 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7848 transitions. Word has length 59 [2019-10-02 14:56:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:43,138 INFO L475 AbstractCegarLoop]: Abstraction has 5697 states and 7848 transitions. [2019-10-02 14:56:43,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7848 transitions. [2019-10-02 14:56:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:43,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:43,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:43,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash 11887072, now seen corresponding path program 1 times [2019-10-02 14:56:43,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:43,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:43,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:43,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:43,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:43,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:43,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:43,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:43,218 INFO L87 Difference]: Start difference. First operand 5697 states and 7848 transitions. Second operand 3 states. [2019-10-02 14:56:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:44,099 INFO L93 Difference]: Finished difference Result 13367 states and 18972 transitions. [2019-10-02 14:56:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:44,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 14:56:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:44,123 INFO L225 Difference]: With dead ends: 13367 [2019-10-02 14:56:44,123 INFO L226 Difference]: Without dead ends: 8543 [2019-10-02 14:56:44,137 INFO L640 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-10-02 14:56:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2019-10-02 14:56:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 6757. [2019-10-02 14:56:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-10-02 14:56:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 9505 transitions. [2019-10-02 14:56:44,943 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 9505 transitions. Word has length 60 [2019-10-02 14:56:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:44,944 INFO L475 AbstractCegarLoop]: Abstraction has 6757 states and 9505 transitions. [2019-10-02 14:56:44,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 9505 transitions. [2019-10-02 14:56:44,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:44,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:44,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:44,947 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:44,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2065078364, now seen corresponding path program 1 times [2019-10-02 14:56:44,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:44,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:44,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:44,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:44,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:45,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:45,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:45,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:45,023 INFO L87 Difference]: Start difference. First operand 6757 states and 9505 transitions. Second operand 3 states. [2019-10-02 14:56:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:46,056 INFO L93 Difference]: Finished difference Result 17110 states and 24518 transitions. [2019-10-02 14:56:46,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:46,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 14:56:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:46,077 INFO L225 Difference]: With dead ends: 17110 [2019-10-02 14:56:46,077 INFO L226 Difference]: Without dead ends: 10944 [2019-10-02 14:56:46,090 INFO L640 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-10-02 14:56:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2019-10-02 14:56:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 8515. [2019-10-02 14:56:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-10-02 14:56:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 12125 transitions. [2019-10-02 14:56:46,983 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 12125 transitions. Word has length 60 [2019-10-02 14:56:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:46,983 INFO L475 AbstractCegarLoop]: Abstraction has 8515 states and 12125 transitions. [2019-10-02 14:56:46,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 12125 transitions. [2019-10-02 14:56:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:46,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:46,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:46,986 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:46,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1780702045, now seen corresponding path program 1 times [2019-10-02 14:56:46,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:46,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:46,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:46,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:46,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:47,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:47,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:56:47,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:56:47,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:56:47,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:56:47,441 INFO L87 Difference]: Start difference. First operand 8515 states and 12125 transitions. Second operand 10 states. [2019-10-02 14:56:48,132 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-10-02 14:56:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:51,244 INFO L93 Difference]: Finished difference Result 26562 states and 38135 transitions. [2019-10-02 14:56:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:56:51,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-02 14:56:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:51,367 INFO L225 Difference]: With dead ends: 26562 [2019-10-02 14:56:51,367 INFO L226 Difference]: Without dead ends: 26250 [2019-10-02 14:56:51,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:56:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26250 states. [2019-10-02 14:56:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26250 to 8397. [2019-10-02 14:56:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8397 states. [2019-10-02 14:56:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8397 states to 8397 states and 11978 transitions. [2019-10-02 14:56:52,441 INFO L78 Accepts]: Start accepts. Automaton has 8397 states and 11978 transitions. Word has length 60 [2019-10-02 14:56:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:52,441 INFO L475 AbstractCegarLoop]: Abstraction has 8397 states and 11978 transitions. [2019-10-02 14:56:52,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:56:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8397 states and 11978 transitions. [2019-10-02 14:56:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:56:52,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:52,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:52,445 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:52,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:52,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1604028375, now seen corresponding path program 1 times [2019-10-02 14:56:52,446 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:52,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:52,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:52,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:52,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:53,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:53,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:56:53,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:56:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:56:53,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:56:53,093 INFO L87 Difference]: Start difference. First operand 8397 states and 11978 transitions. Second operand 19 states. [2019-10-02 14:56:53,287 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-02 14:56:54,244 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-10-02 14:56:54,502 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 14:56:54,674 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 14:56:55,668 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-10-02 14:57:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:02,655 INFO L93 Difference]: Finished difference Result 26900 states and 38831 transitions. [2019-10-02 14:57:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:57:02,656 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-10-02 14:57:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:02,689 INFO L225 Difference]: With dead ends: 26900 [2019-10-02 14:57:02,689 INFO L226 Difference]: Without dead ends: 26896 [2019-10-02 14:57:02,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:57:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26896 states. [2019-10-02 14:57:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26896 to 8410. [2019-10-02 14:57:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8410 states. [2019-10-02 14:57:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8410 states to 8410 states and 11996 transitions. [2019-10-02 14:57:03,840 INFO L78 Accepts]: Start accepts. Automaton has 8410 states and 11996 transitions. Word has length 61 [2019-10-02 14:57:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:03,840 INFO L475 AbstractCegarLoop]: Abstraction has 8410 states and 11996 transitions. [2019-10-02 14:57:03,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:57:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 8410 states and 11996 transitions. [2019-10-02 14:57:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 14:57:03,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:03,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:03,842 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash -212777880, now seen corresponding path program 1 times [2019-10-02 14:57:03,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:03,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:03,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:03,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:04,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:04,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 14:57:04,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:57:04,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:57:04,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:57:04,579 INFO L87 Difference]: Start difference. First operand 8410 states and 11996 transitions. Second operand 15 states. [2019-10-02 14:57:05,207 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-02 14:57:05,479 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 14:57:05,808 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 14:57:06,175 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-02 14:57:07,622 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-02 14:57:08,194 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-02 14:57:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:11,171 INFO L93 Difference]: Finished difference Result 17309 states and 24714 transitions. [2019-10-02 14:57:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:57:11,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-10-02 14:57:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:11,190 INFO L225 Difference]: With dead ends: 17309 [2019-10-02 14:57:11,190 INFO L226 Difference]: Without dead ends: 17066 [2019-10-02 14:57:11,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:57:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17066 states. [2019-10-02 14:57:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17066 to 8401. [2019-10-02 14:57:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8401 states. [2019-10-02 14:57:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8401 states to 8401 states and 11984 transitions. [2019-10-02 14:57:12,445 INFO L78 Accepts]: Start accepts. Automaton has 8401 states and 11984 transitions. Word has length 62 [2019-10-02 14:57:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:12,445 INFO L475 AbstractCegarLoop]: Abstraction has 8401 states and 11984 transitions. [2019-10-02 14:57:12,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:57:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8401 states and 11984 transitions. [2019-10-02 14:57:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 14:57:12,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:12,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:12,448 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash -287029914, now seen corresponding path program 1 times [2019-10-02 14:57:12,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:12,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:12,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:12,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:12,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:12,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:12,550 INFO L87 Difference]: Start difference. First operand 8401 states and 11984 transitions. Second operand 6 states. [2019-10-02 14:57:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:17,336 INFO L93 Difference]: Finished difference Result 37777 states and 54136 transitions. [2019-10-02 14:57:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:57:17,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-02 14:57:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:17,369 INFO L225 Difference]: With dead ends: 37777 [2019-10-02 14:57:17,369 INFO L226 Difference]: Without dead ends: 30047 [2019-10-02 14:57:17,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:57:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30047 states. [2019-10-02 14:57:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30047 to 26291. [2019-10-02 14:57:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26291 states. [2019-10-02 14:57:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26291 states to 26291 states and 36779 transitions. [2019-10-02 14:57:22,332 INFO L78 Accepts]: Start accepts. Automaton has 26291 states and 36779 transitions. Word has length 65 [2019-10-02 14:57:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:22,333 INFO L475 AbstractCegarLoop]: Abstraction has 26291 states and 36779 transitions. [2019-10-02 14:57:22,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 26291 states and 36779 transitions. [2019-10-02 14:57:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:57:22,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:22,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:22,335 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -586005098, now seen corresponding path program 1 times [2019-10-02 14:57:22,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:22,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:22,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:22,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:57:22,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:57:22,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:57:22,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:22,469 INFO L87 Difference]: Start difference. First operand 26291 states and 36779 transitions. Second operand 5 states. [2019-10-02 14:57:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:25,459 INFO L93 Difference]: Finished difference Result 41344 states and 57832 transitions. [2019-10-02 14:57:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:25,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-02 14:57:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:25,479 INFO L225 Difference]: With dead ends: 41344 [2019-10-02 14:57:25,479 INFO L226 Difference]: Without dead ends: 15688 [2019-10-02 14:57:25,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15688 states. [2019-10-02 14:57:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15688 to 12519. [2019-10-02 14:57:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12519 states. [2019-10-02 14:57:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12519 states to 12519 states and 17153 transitions. [2019-10-02 14:57:28,039 INFO L78 Accepts]: Start accepts. Automaton has 12519 states and 17153 transitions. Word has length 66 [2019-10-02 14:57:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:28,039 INFO L475 AbstractCegarLoop]: Abstraction has 12519 states and 17153 transitions. [2019-10-02 14:57:28,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:57:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 12519 states and 17153 transitions. [2019-10-02 14:57:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 14:57:28,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:28,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:28,042 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -584887692, now seen corresponding path program 1 times [2019-10-02 14:57:28,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:28,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:28,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:28,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:28,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:28,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:28,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:28,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:28,264 INFO L87 Difference]: Start difference. First operand 12519 states and 17153 transitions. Second operand 6 states. [2019-10-02 14:57:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:32,804 INFO L93 Difference]: Finished difference Result 22387 states and 30390 transitions. [2019-10-02 14:57:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:57:32,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-02 14:57:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:32,830 INFO L225 Difference]: With dead ends: 22387 [2019-10-02 14:57:32,830 INFO L226 Difference]: Without dead ends: 22385 [2019-10-02 14:57:32,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22385 states. [2019-10-02 14:57:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22385 to 12927. [2019-10-02 14:57:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12927 states. [2019-10-02 14:57:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12927 states to 12927 states and 17470 transitions. [2019-10-02 14:57:35,427 INFO L78 Accepts]: Start accepts. Automaton has 12927 states and 17470 transitions. Word has length 70 [2019-10-02 14:57:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:35,428 INFO L475 AbstractCegarLoop]: Abstraction has 12927 states and 17470 transitions. [2019-10-02 14:57:35,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12927 states and 17470 transitions. [2019-10-02 14:57:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 14:57:35,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:35,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:35,432 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash -793759712, now seen corresponding path program 1 times [2019-10-02 14:57:35,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:35,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:35,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:35,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:35,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:35,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:35,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:35,523 INFO L87 Difference]: Start difference. First operand 12927 states and 17470 transitions. Second operand 3 states. [2019-10-02 14:57:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:40,164 INFO L93 Difference]: Finished difference Result 34486 states and 46730 transitions. [2019-10-02 14:57:40,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:40,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 14:57:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:40,195 INFO L225 Difference]: With dead ends: 34486 [2019-10-02 14:57:40,195 INFO L226 Difference]: Without dead ends: 22127 [2019-10-02 14:57:40,213 INFO L640 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-10-02 14:57:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22127 states. [2019-10-02 14:57:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22127 to 22125. [2019-10-02 14:57:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22125 states. [2019-10-02 14:57:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22125 states to 22125 states and 29664 transitions. [2019-10-02 14:57:44,659 INFO L78 Accepts]: Start accepts. Automaton has 22125 states and 29664 transitions. Word has length 71 [2019-10-02 14:57:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:44,660 INFO L475 AbstractCegarLoop]: Abstraction has 22125 states and 29664 transitions. [2019-10-02 14:57:44,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 22125 states and 29664 transitions. [2019-10-02 14:57:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 14:57:44,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:44,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:44,664 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1879683765, now seen corresponding path program 1 times [2019-10-02 14:57:44,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:44,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:44,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:44,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:44,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:44,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:44,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:57:44,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:57:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:57:44,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:44,779 INFO L87 Difference]: Start difference. First operand 22125 states and 29664 transitions. Second operand 5 states. [2019-10-02 14:57:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:55,330 INFO L93 Difference]: Finished difference Result 70149 states and 94613 transitions. [2019-10-02 14:57:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:57:55,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-02 14:57:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:55,388 INFO L225 Difference]: With dead ends: 70149 [2019-10-02 14:57:55,388 INFO L226 Difference]: Without dead ends: 48568 [2019-10-02 14:57:55,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48568 states. [2019-10-02 14:58:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48568 to 29319. [2019-10-02 14:58:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29319 states. [2019-10-02 14:58:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29319 states to 29319 states and 38668 transitions. [2019-10-02 14:58:00,951 INFO L78 Accepts]: Start accepts. Automaton has 29319 states and 38668 transitions. Word has length 75 [2019-10-02 14:58:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:00,952 INFO L475 AbstractCegarLoop]: Abstraction has 29319 states and 38668 transitions. [2019-10-02 14:58:00,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:58:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29319 states and 38668 transitions. [2019-10-02 14:58:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 14:58:00,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:00,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:00,958 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:00,958 INFO L82 PathProgramCache]: Analyzing trace with hash 435599465, now seen corresponding path program 1 times [2019-10-02 14:58:00,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:00,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:00,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:00,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:00,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:01,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:01,050 INFO L87 Difference]: Start difference. First operand 29319 states and 38668 transitions. Second operand 5 states. [2019-10-02 14:58:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:17,389 INFO L93 Difference]: Finished difference Result 102103 states and 134190 transitions. [2019-10-02 14:58:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:58:17,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-02 14:58:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:17,484 INFO L225 Difference]: With dead ends: 102103 [2019-10-02 14:58:17,484 INFO L226 Difference]: Without dead ends: 73342 [2019-10-02 14:58:17,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:58:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73342 states. [2019-10-02 14:58:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73342 to 49878. [2019-10-02 14:58:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49878 states. [2019-10-02 14:58:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49878 states to 49878 states and 65222 transitions. [2019-10-02 14:58:29,179 INFO L78 Accepts]: Start accepts. Automaton has 49878 states and 65222 transitions. Word has length 81 [2019-10-02 14:58:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:29,180 INFO L475 AbstractCegarLoop]: Abstraction has 49878 states and 65222 transitions. [2019-10-02 14:58:29,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:58:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 49878 states and 65222 transitions. [2019-10-02 14:58:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 14:58:29,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:29,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:29,185 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1991987475, now seen corresponding path program 1 times [2019-10-02 14:58:29,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:29,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:29,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:29,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:29,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:29,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:29,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:29,294 INFO L87 Difference]: Start difference. First operand 49878 states and 65222 transitions. Second operand 3 states. [2019-10-02 14:58:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:47,277 INFO L93 Difference]: Finished difference Result 138265 states and 180385 transitions. [2019-10-02 14:58:47,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:47,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-02 14:58:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:47,398 INFO L225 Difference]: With dead ends: 138265 [2019-10-02 14:58:47,399 INFO L226 Difference]: Without dead ends: 88949 [2019-10-02 14:58:47,441 INFO L640 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-10-02 14:58:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88949 states. [2019-10-02 14:59:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88949 to 66953. [2019-10-02 14:59:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66953 states. [2019-10-02 14:59:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66953 states to 66953 states and 86015 transitions. [2019-10-02 14:59:03,071 INFO L78 Accepts]: Start accepts. Automaton has 66953 states and 86015 transitions. Word has length 83 [2019-10-02 14:59:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:03,071 INFO L475 AbstractCegarLoop]: Abstraction has 66953 states and 86015 transitions. [2019-10-02 14:59:03,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:59:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 66953 states and 86015 transitions. [2019-10-02 14:59:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 14:59:03,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:03,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:03,076 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash -530585101, now seen corresponding path program 1 times [2019-10-02 14:59:03,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:03,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:03,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:03,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:03,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:03,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:03,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:03,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:03,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:03,159 INFO L87 Difference]: Start difference. First operand 66953 states and 86015 transitions. Second operand 3 states. [2019-10-02 14:59:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:21,434 INFO L93 Difference]: Finished difference Result 155824 states and 199674 transitions. [2019-10-02 14:59:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:59:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-02 14:59:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:21,547 INFO L225 Difference]: With dead ends: 155824 [2019-10-02 14:59:21,547 INFO L226 Difference]: Without dead ends: 89433 [2019-10-02 14:59:21,589 INFO L640 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-10-02 14:59:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89433 states. [2019-10-02 14:59:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89433 to 67520. [2019-10-02 14:59:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67520 states. [2019-10-02 14:59:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67520 states to 67520 states and 84969 transitions. [2019-10-02 14:59:37,879 INFO L78 Accepts]: Start accepts. Automaton has 67520 states and 84969 transitions. Word has length 86 [2019-10-02 14:59:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:37,880 INFO L475 AbstractCegarLoop]: Abstraction has 67520 states and 84969 transitions. [2019-10-02 14:59:37,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:59:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 67520 states and 84969 transitions. [2019-10-02 14:59:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 14:59:37,884 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:37,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:37,884 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2116981400, now seen corresponding path program 1 times [2019-10-02 14:59:37,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:37,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:37,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:37,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:37,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:37,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:37,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:37,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:37,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:37,982 INFO L87 Difference]: Start difference. First operand 67520 states and 84969 transitions. Second operand 3 states. [2019-10-02 14:59:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:54,695 INFO L93 Difference]: Finished difference Result 146088 states and 183011 transitions. [2019-10-02 14:59:54,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:59:54,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-02 14:59:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:54,784 INFO L225 Difference]: With dead ends: 146088 [2019-10-02 14:59:54,784 INFO L226 Difference]: Without dead ends: 79098 [2019-10-02 14:59:54,838 INFO L640 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-10-02 14:59:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79098 states. [2019-10-02 15:00:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79098 to 75549. [2019-10-02 15:00:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75549 states. [2019-10-02 15:00:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75549 states to 75549 states and 93720 transitions. [2019-10-02 15:00:13,204 INFO L78 Accepts]: Start accepts. Automaton has 75549 states and 93720 transitions. Word has length 89 [2019-10-02 15:00:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:13,204 INFO L475 AbstractCegarLoop]: Abstraction has 75549 states and 93720 transitions. [2019-10-02 15:00:13,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 75549 states and 93720 transitions. [2019-10-02 15:00:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 15:00:13,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:13,212 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:13,212 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1675942405, now seen corresponding path program 1 times [2019-10-02 15:00:13,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:13,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:13,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:13,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:13,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:13,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:00:13,341 INFO L224 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-10-02 15:00:13,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:13,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 15:00:13,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:00:13,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:00:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:14,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:00:14,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-10-02 15:00:14,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 15:00:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 15:00:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 15:00:14,093 INFO L87 Difference]: Start difference. First operand 75549 states and 93720 transitions. Second operand 12 states. [2019-10-02 15:00:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:49,470 INFO L93 Difference]: Finished difference Result 208534 states and 259728 transitions. [2019-10-02 15:00:49,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 15:00:49,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-10-02 15:00:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:49,809 INFO L225 Difference]: With dead ends: 208534 [2019-10-02 15:00:49,809 INFO L226 Difference]: Without dead ends: 133515 [2019-10-02 15:00:49,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=615, Unknown=0, NotChecked=0, Total=870 [2019-10-02 15:00:50,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133515 states. [2019-10-02 15:01:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133515 to 86250. [2019-10-02 15:01:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86250 states. [2019-10-02 15:01:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86250 states to 86250 states and 107383 transitions. [2019-10-02 15:01:12,699 INFO L78 Accepts]: Start accepts. Automaton has 86250 states and 107383 transitions. Word has length 95 [2019-10-02 15:01:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:12,699 INFO L475 AbstractCegarLoop]: Abstraction has 86250 states and 107383 transitions. [2019-10-02 15:01:12,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 15:01:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 86250 states and 107383 transitions. [2019-10-02 15:01:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 15:01:12,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:12,713 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:12,714 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash 106004821, now seen corresponding path program 1 times [2019-10-02 15:01:12,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:12,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:12,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:12,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:12,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:12,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:12,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:12,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:12,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:12,875 INFO L87 Difference]: Start difference. First operand 86250 states and 107383 transitions. Second operand 5 states. [2019-10-02 15:01:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:44,939 INFO L93 Difference]: Finished difference Result 190821 states and 237127 transitions. [2019-10-02 15:01:44,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:01:44,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-02 15:01:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:45,175 INFO L225 Difference]: With dead ends: 190821 [2019-10-02 15:01:45,175 INFO L226 Difference]: Without dead ends: 105276 [2019-10-02 15:01:45,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:01:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105276 states. [2019-10-02 15:02:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105276 to 83187. [2019-10-02 15:02:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83187 states. [2019-10-02 15:02:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83187 states to 83187 states and 101878 transitions. [2019-10-02 15:02:07,581 INFO L78 Accepts]: Start accepts. Automaton has 83187 states and 101878 transitions. Word has length 99 [2019-10-02 15:02:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:07,581 INFO L475 AbstractCegarLoop]: Abstraction has 83187 states and 101878 transitions. [2019-10-02 15:02:07,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:02:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 83187 states and 101878 transitions. [2019-10-02 15:02:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 15:02:07,592 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:07,593 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:07,593 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash -291839216, now seen corresponding path program 1 times [2019-10-02 15:02:07,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:07,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:07,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:07,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 15:02:07,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:07,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:07,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:07,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:07,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:07,691 INFO L87 Difference]: Start difference. First operand 83187 states and 101878 transitions. Second operand 3 states. [2019-10-02 15:02:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:32,183 INFO L93 Difference]: Finished difference Result 118611 states and 144940 transitions. [2019-10-02 15:02:32,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:32,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-02 15:02:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:32,271 INFO L225 Difference]: With dead ends: 118611 [2019-10-02 15:02:32,271 INFO L226 Difference]: Without dead ends: 81911 [2019-10-02 15:02:32,304 INFO L640 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-10-02 15:02:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81911 states. [2019-10-02 15:02:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81911 to 81689. [2019-10-02 15:02:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81689 states. [2019-10-02 15:02:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81689 states to 81689 states and 98536 transitions. [2019-10-02 15:02:53,692 INFO L78 Accepts]: Start accepts. Automaton has 81689 states and 98536 transitions. Word has length 99 [2019-10-02 15:02:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:53,692 INFO L475 AbstractCegarLoop]: Abstraction has 81689 states and 98536 transitions. [2019-10-02 15:02:53,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 81689 states and 98536 transitions. [2019-10-02 15:02:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 15:02:53,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:53,700 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:53,701 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1348348173, now seen corresponding path program 1 times [2019-10-02 15:02:53,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:53,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:53,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:53,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:53,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 15:02:53,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:53,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:53,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:53,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:53,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:53,794 INFO L87 Difference]: Start difference. First operand 81689 states and 98536 transitions. Second operand 3 states. [2019-10-02 15:03:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:15,642 INFO L93 Difference]: Finished difference Result 112305 states and 135426 transitions. [2019-10-02 15:03:15,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:15,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-02 15:03:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:15,733 INFO L225 Difference]: With dead ends: 112305 [2019-10-02 15:03:15,733 INFO L226 Difference]: Without dead ends: 81583 [2019-10-02 15:03:15,763 INFO L640 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-10-02 15:03:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81583 states. [2019-10-02 15:03:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81583 to 60348. [2019-10-02 15:03:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60348 states. [2019-10-02 15:03:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60348 states to 60348 states and 72317 transitions. [2019-10-02 15:03:36,719 INFO L78 Accepts]: Start accepts. Automaton has 60348 states and 72317 transitions. Word has length 101 [2019-10-02 15:03:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:36,720 INFO L475 AbstractCegarLoop]: Abstraction has 60348 states and 72317 transitions. [2019-10-02 15:03:36,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 60348 states and 72317 transitions. [2019-10-02 15:03:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 15:03:36,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:36,728 INFO L411 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, 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-10-02 15:03:36,728 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:36,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:36,728 INFO L82 PathProgramCache]: Analyzing trace with hash 170954536, now seen corresponding path program 1 times [2019-10-02 15:03:36,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:36,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:03:36,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:36,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:03:36,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:03:36,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:03:36,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:03:36,867 INFO L87 Difference]: Start difference. First operand 60348 states and 72317 transitions. Second operand 5 states. [2019-10-02 15:04:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:06,516 INFO L93 Difference]: Finished difference Result 122543 states and 147054 transitions. [2019-10-02 15:04:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:04:06,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-02 15:04:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:06,618 INFO L225 Difference]: With dead ends: 122543 [2019-10-02 15:04:06,618 INFO L226 Difference]: Without dead ends: 91174 [2019-10-02 15:04:06,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:04:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91174 states. [2019-10-02 15:04:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91174 to 76949. [2019-10-02 15:04:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76949 states. [2019-10-02 15:04:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76949 states to 76949 states and 92073 transitions. [2019-10-02 15:04:33,211 INFO L78 Accepts]: Start accepts. Automaton has 76949 states and 92073 transitions. Word has length 104 [2019-10-02 15:04:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:33,211 INFO L475 AbstractCegarLoop]: Abstraction has 76949 states and 92073 transitions. [2019-10-02 15:04:33,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:04:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 76949 states and 92073 transitions. [2019-10-02 15:04:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 15:04:33,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:33,220 INFO L411 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, 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-10-02 15:04:33,221 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:33,221 INFO L82 PathProgramCache]: Analyzing trace with hash -240157060, now seen corresponding path program 1 times [2019-10-02 15:04:33,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:33,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:33,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:33,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:33,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 15:04:33,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:33,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:04:33,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:04:33,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:04:33,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:04:33,342 INFO L87 Difference]: Start difference. First operand 76949 states and 92073 transitions. Second operand 5 states. [2019-10-02 15:05:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:05,762 INFO L93 Difference]: Finished difference Result 116457 states and 139733 transitions. [2019-10-02 15:05:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:05:05,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-02 15:05:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:05,887 INFO L225 Difference]: With dead ends: 116457 [2019-10-02 15:05:05,888 INFO L226 Difference]: Without dead ends: 99221 [2019-10-02 15:05:05,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:05:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99221 states. [2019-10-02 15:05:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99221 to 88101. [2019-10-02 15:05:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88101 states. [2019-10-02 15:05:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88101 states to 88101 states and 105376 transitions. [2019-10-02 15:05:34,567 INFO L78 Accepts]: Start accepts. Automaton has 88101 states and 105376 transitions. Word has length 104 [2019-10-02 15:05:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:34,567 INFO L475 AbstractCegarLoop]: Abstraction has 88101 states and 105376 transitions. [2019-10-02 15:05:34,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:05:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 88101 states and 105376 transitions. [2019-10-02 15:05:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 15:05:34,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:34,576 INFO L411 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, 1, 1, 1, 1, 1, 1, 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-10-02 15:05:34,577 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1523617051, now seen corresponding path program 1 times [2019-10-02 15:05:34,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:34,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:34,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 15:05:34,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:34,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:34,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:34,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:34,670 INFO L87 Difference]: Start difference. First operand 88101 states and 105376 transitions. Second operand 4 states. [2019-10-02 15:06:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:15,307 INFO L93 Difference]: Finished difference Result 138275 states and 165176 transitions. [2019-10-02 15:06:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:06:15,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-02 15:06:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:15,440 INFO L225 Difference]: With dead ends: 138275 [2019-10-02 15:06:15,441 INFO L226 Difference]: Without dead ends: 121545 [2019-10-02 15:06:15,472 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:06:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121545 states. [2019-10-02 15:06:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121545 to 88101. [2019-10-02 15:06:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88101 states. [2019-10-02 15:06:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88101 states to 88101 states and 105376 transitions. [2019-10-02 15:06:45,508 INFO L78 Accepts]: Start accepts. Automaton has 88101 states and 105376 transitions. Word has length 110 [2019-10-02 15:06:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:45,509 INFO L475 AbstractCegarLoop]: Abstraction has 88101 states and 105376 transitions. [2019-10-02 15:06:45,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:06:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 88101 states and 105376 transitions. [2019-10-02 15:06:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 15:06:45,517 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:45,517 INFO L411 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, 1, 1, 1, 1, 1, 1, 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-10-02 15:06:45,517 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash -374913254, now seen corresponding path program 1 times [2019-10-02 15:06:45,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:45,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:45,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:45,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:45,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:06:45,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:06:45,753 INFO L224 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-10-02 15:06:45,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:46,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 15:06:46,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:06:46,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:06:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:06:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 15:06:46,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2019-10-02 15:06:46,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 15:06:46,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 15:06:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2019-10-02 15:06:46,813 INFO L87 Difference]: Start difference. First operand 88101 states and 105376 transitions. Second operand 21 states. [2019-10-02 15:06:46,974 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-02 15:06:53,831 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-02 15:06:54,272 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-02 15:06:54,744 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-02 15:06:54,963 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:06:55,139 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-02 15:06:55,400 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 15:06:56,149 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:06:56,702 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-02 15:06:57,435 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 15:06:58,101 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-02 15:06:59,579 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-02 15:07:00,030 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-02 15:07:00,302 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:07:00,633 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:07:01,852 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 15:07:02,353 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 15:07:04,347 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-02 15:07:04,597 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-02 15:07:05,139 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-02 15:07:05,537 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:07:05,702 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:07:05,926 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:07:06,078 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 15:07:07,034 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 15:07:07,229 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 15:07:07,615 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-10-02 15:07:08,217 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-10-02 15:07:08,620 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-10-02 15:07:08,862 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 15:07:09,051 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-02 15:07:09,594 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 15:07:10,439 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-02 15:07:10,936 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-02 15:07:11,263 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-02 15:07:11,621 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-10-02 15:07:12,102 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-10-02 15:07:12,264 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-02 15:07:14,830 WARN L191 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-10-02 15:07:15,315 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-10-02 15:07:15,877 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-02 15:07:16,173 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-02 15:07:16,753 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-10-02 15:07:17,041 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-10-02 15:07:17,883 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-10-02 15:07:18,140 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-10-02 15:07:18,418 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-10-02 15:07:18,614 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-02 15:07:18,909 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 15:07:19,274 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 15:07:19,550 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-10-02 15:07:19,733 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 15:07:20,083 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 15:07:20,741 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-10-02 15:07:20,903 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-02 15:07:21,059 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-10-02 15:07:21,201 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-10-02 15:07:21,471 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 15:07:21,871 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 15:07:22,142 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-10-02 15:07:22,388 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-10-02 15:07:23,050 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-10-02 15:07:23,450 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-02 15:07:23,955 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-02 15:07:25,043 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-02 15:07:25,408 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-02 15:07:26,103 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-10-02 15:07:26,863 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-02 15:07:27,327 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-02 15:07:28,740 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-10-02 15:07:30,567 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-02 15:07:31,073 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 15:07:33,122 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-10-02 15:07:34,363 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 15:07:40,789 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-10-02 15:07:41,644 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-10-02 15:07:41,962 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-02 15:07:42,770 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-02 15:07:43,058 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 15:07:43,546 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-02 15:07:43,946 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-10-02 15:07:44,189 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-02 15:07:45,194 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-02 15:07:45,428 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-10-02 15:07:45,698 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-02 15:07:46,806 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-02 15:07:47,013 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 15:07:48,382 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-02 15:07:48,789 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-02 15:07:49,964 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-02 15:07:50,483 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-02 15:07:50,780 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-10-02 15:07:51,366 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-10-02 15:07:52,375 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-02 15:07:52,932 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-02 15:07:53,765 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-02 15:07:54,077 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-02 15:08:04,495 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-10-02 15:08:05,719 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 15:08:10,031 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 15:08:10,190 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-02 15:08:12,783 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-02 15:08:12,940 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 15:08:14,834 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-10-02 15:08:17,960 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-10-02 15:08:18,301 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60