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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 15:03:26,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 15:03:26,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 15:03:26,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 15:03:26,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 15:03:26,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 15:03:26,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 15:03:26,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 15:03:26,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 15:03:26,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 15:03:26,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 15:03:26,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 15:03:26,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 15:03:26,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 15:03:26,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 15:03:26,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 15:03:26,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 15:03:26,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 15:03:26,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 15:03:26,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 15:03:26,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 15:03:26,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 15:03:26,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 15:03:26,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 15:03:26,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 15:03:26,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 15:03:26,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 15:03:26,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 15:03:26,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 15:03:26,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 15:03:26,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 15:03:26,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 15:03:26,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 15:03:26,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 15:03:26,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 15:03:26,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 15:03:26,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 15:03:26,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 15:03:26,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 15:03:26,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 15:03:26,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 15:03:26,957 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 15:03:26,971 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 15:03:26,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 15:03:26,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 15:03:26,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 15:03:26,973 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 15:03:26,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 15:03:26,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 15:03:26,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 15:03:26,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 15:03:26,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 15:03:26,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 15:03:26,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 15:03:26,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 15:03:26,975 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 15:03:26,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 15:03:26,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 15:03:26,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 15:03:26,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 15:03:26,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 15:03:26,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 15:03:26,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 15:03:26,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:03:26,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 15:03:26,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 15:03:26,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 15:03:26,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 15:03:26,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 15:03:26,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 15:03:26,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 15:03:27,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 15:03:27,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 15:03:27,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 15:03:27,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 15:03:27,031 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 15:03:27,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-02 15:03:27,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65965c3f0/f43cccbe270347e980bfb801d5c89d74/FLAG3101249bc [2019-10-02 15:03:27,678 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 15:03:27,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-02 15:03:27,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65965c3f0/f43cccbe270347e980bfb801d5c89d74/FLAG3101249bc [2019-10-02 15:03:27,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65965c3f0/f43cccbe270347e980bfb801d5c89d74 [2019-10-02 15:03:27,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 15:03:27,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 15:03:27,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 15:03:27,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 15:03:27,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 15:03:27,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:03:27" (1/1) ... [2019-10-02 15:03:27,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5d4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:27, skipping insertion in model container [2019-10-02 15:03:27,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:03:27" (1/1) ... [2019-10-02 15:03:27,967 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 15:03:28,046 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 15:03:28,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:03:28,733 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 15:03:29,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:03:29,134 INFO L192 MainTranslator]: Completed translation [2019-10-02 15:03:29,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29 WrapperNode [2019-10-02 15:03:29,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 15:03:29,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 15:03:29,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 15:03:29,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 15:03:29,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (1/1) ... [2019-10-02 15:03:29,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (1/1) ... [2019-10-02 15:03:29,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (1/1) ... [2019-10-02 15:03:29,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (1/1) ... [2019-10-02 15:03:29,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (1/1) ... [2019-10-02 15:03:29,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (1/1) ... [2019-10-02 15:03:29,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (1/1) ... [2019-10-02 15:03:29,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 15:03:29,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 15:03:29,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 15:03:29,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 15:03:29,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (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 15:03:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 15:03:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 15:03:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 15:03:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 15:03:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 15:03:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 15:03:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 15:03:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 15:03:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 15:03:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 15:03:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 15:03:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 15:03:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 15:03:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 15:03:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 15:03:29,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 15:03:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 15:03:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 15:03:31,136 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 15:03:31,136 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 15:03:31,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:03:31 BoogieIcfgContainer [2019-10-02 15:03:31,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 15:03:31,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 15:03:31,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 15:03:31,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 15:03:31,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 03:03:27" (1/3) ... [2019-10-02 15:03:31,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45077d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:03:31, skipping insertion in model container [2019-10-02 15:03:31,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:03:29" (2/3) ... [2019-10-02 15:03:31,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45077d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:03:31, skipping insertion in model container [2019-10-02 15:03:31,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:03:31" (3/3) ... [2019-10-02 15:03:31,149 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-02 15:03:31,162 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 15:03:31,176 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-02 15:03:31,193 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-02 15:03:31,259 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 15:03:31,260 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 15:03:31,260 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 15:03:31,260 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 15:03:31,261 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 15:03:31,261 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 15:03:31,261 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 15:03:31,261 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 15:03:31,261 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 15:03:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-10-02 15:03:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 15:03:31,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:31,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,345 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash 42890573, now seen corresponding path program 1 times [2019-10-02 15:03:31,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:31,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:31,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:31,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:32,363 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 15:03:32,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:32,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:03:32,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:03:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:03:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:32,388 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 4 states. [2019-10-02 15:03:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:32,676 INFO L93 Difference]: Finished difference Result 1212 states and 2155 transitions. [2019-10-02 15:03:32,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:03:32,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-02 15:03:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:32,709 INFO L225 Difference]: With dead ends: 1212 [2019-10-02 15:03:32,709 INFO L226 Difference]: Without dead ends: 799 [2019-10-02 15:03:32,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:03:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-02 15:03:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2019-10-02 15:03:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-02 15:03:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1109 transitions. [2019-10-02 15:03:32,844 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1109 transitions. Word has length 152 [2019-10-02 15:03:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:32,845 INFO L475 AbstractCegarLoop]: Abstraction has 773 states and 1109 transitions. [2019-10-02 15:03:32,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:03:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1109 transitions. [2019-10-02 15:03:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 15:03:32,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:32,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,849 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash -832663523, now seen corresponding path program 1 times [2019-10-02 15:03:32,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:32,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:32,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:32,975 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 15:03:32,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:32,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:32,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:32,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:32,981 INFO L87 Difference]: Start difference. First operand 773 states and 1109 transitions. Second operand 3 states. [2019-10-02 15:03:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:33,064 INFO L93 Difference]: Finished difference Result 2273 states and 3257 transitions. [2019-10-02 15:03:33,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:33,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-02 15:03:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:33,074 INFO L225 Difference]: With dead ends: 2273 [2019-10-02 15:03:33,075 INFO L226 Difference]: Without dead ends: 1532 [2019-10-02 15:03:33,078 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:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-10-02 15:03:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 775. [2019-10-02 15:03:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-10-02 15:03:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1111 transitions. [2019-10-02 15:03:33,166 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1111 transitions. Word has length 153 [2019-10-02 15:03:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:33,168 INFO L475 AbstractCegarLoop]: Abstraction has 775 states and 1111 transitions. [2019-10-02 15:03:33,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1111 transitions. [2019-10-02 15:03:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 15:03:33,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,173 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:33,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1878298894, now seen corresponding path program 1 times [2019-10-02 15:03:33,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:33,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:33,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:33,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:33,447 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 15:03:33,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:33,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:03:33,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:03:33,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:03:33,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:33,451 INFO L87 Difference]: Start difference. First operand 775 states and 1111 transitions. Second operand 4 states. [2019-10-02 15:03:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:33,516 INFO L93 Difference]: Finished difference Result 1532 states and 2197 transitions. [2019-10-02 15:03:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:03:33,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-02 15:03:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:33,525 INFO L225 Difference]: With dead ends: 1532 [2019-10-02 15:03:33,526 INFO L226 Difference]: Without dead ends: 775 [2019-10-02 15:03:33,529 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:03:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-02 15:03:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 774. [2019-10-02 15:03:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-02 15:03:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1108 transitions. [2019-10-02 15:03:33,573 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1108 transitions. Word has length 154 [2019-10-02 15:03:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:33,574 INFO L475 AbstractCegarLoop]: Abstraction has 774 states and 1108 transitions. [2019-10-02 15:03:33,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:03:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1108 transitions. [2019-10-02 15:03:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 15:03:33,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:33,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,578 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1636071890, now seen corresponding path program 1 times [2019-10-02 15:03:33,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:33,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:33,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:33,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:33,801 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 15:03:33,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:33,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:03:33,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:03:33,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:03:33,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:33,803 INFO L87 Difference]: Start difference. First operand 774 states and 1108 transitions. Second operand 4 states. [2019-10-02 15:03:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:33,913 INFO L93 Difference]: Finished difference Result 1535 states and 2199 transitions. [2019-10-02 15:03:33,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:03:33,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-02 15:03:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:33,920 INFO L225 Difference]: With dead ends: 1535 [2019-10-02 15:03:33,920 INFO L226 Difference]: Without dead ends: 772 [2019-10-02 15:03:33,923 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:03:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-10-02 15:03:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2019-10-02 15:03:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-10-02 15:03:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1104 transitions. [2019-10-02 15:03:33,967 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1104 transitions. Word has length 154 [2019-10-02 15:03:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:33,967 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 1104 transitions. [2019-10-02 15:03:33,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:03:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1104 transitions. [2019-10-02 15:03:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 15:03:33,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:33,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,971 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash -674126987, now seen corresponding path program 1 times [2019-10-02 15:03:33,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:33,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:33,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:33,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:33,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:34,153 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 15:03:34,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:34,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:34,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:34,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:34,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:34,155 INFO L87 Difference]: Start difference. First operand 772 states and 1104 transitions. Second operand 3 states. [2019-10-02 15:03:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:34,277 INFO L93 Difference]: Finished difference Result 1732 states and 2480 transitions. [2019-10-02 15:03:34,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:34,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-02 15:03:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:34,284 INFO L225 Difference]: With dead ends: 1732 [2019-10-02 15:03:34,284 INFO L226 Difference]: Without dead ends: 1156 [2019-10-02 15:03:34,286 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:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-10-02 15:03:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1130. [2019-10-02 15:03:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-02 15:03:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1602 transitions. [2019-10-02 15:03:34,339 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1602 transitions. Word has length 154 [2019-10-02 15:03:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:34,340 INFO L475 AbstractCegarLoop]: Abstraction has 1130 states and 1602 transitions. [2019-10-02 15:03:34,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1602 transitions. [2019-10-02 15:03:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 15:03:34,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:34,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,344 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1140766677, now seen corresponding path program 1 times [2019-10-02 15:03:34,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:34,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:34,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:34,435 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 15:03:34,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:34,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:34,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:34,437 INFO L87 Difference]: Start difference. First operand 1130 states and 1602 transitions. Second operand 3 states. [2019-10-02 15:03:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:34,553 INFO L93 Difference]: Finished difference Result 2442 states and 3547 transitions. [2019-10-02 15:03:34,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:34,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-02 15:03:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:34,562 INFO L225 Difference]: With dead ends: 2442 [2019-10-02 15:03:34,562 INFO L226 Difference]: Without dead ends: 1501 [2019-10-02 15:03:34,565 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:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-10-02 15:03:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1342. [2019-10-02 15:03:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-02 15:03:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1945 transitions. [2019-10-02 15:03:34,648 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1945 transitions. Word has length 156 [2019-10-02 15:03:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:34,649 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1945 transitions. [2019-10-02 15:03:34,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1945 transitions. [2019-10-02 15:03:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 15:03:34,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,654 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1542236816, now seen corresponding path program 1 times [2019-10-02 15:03:34,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:34,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:34,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:34,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:34,823 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 15:03:34,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:34,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:34,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:34,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:34,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:34,825 INFO L87 Difference]: Start difference. First operand 1342 states and 1945 transitions. Second operand 3 states. [2019-10-02 15:03:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:35,002 INFO L93 Difference]: Finished difference Result 2987 states and 4450 transitions. [2019-10-02 15:03:35,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:35,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 15:03:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:35,019 INFO L225 Difference]: With dead ends: 2987 [2019-10-02 15:03:35,019 INFO L226 Difference]: Without dead ends: 1918 [2019-10-02 15:03:35,023 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:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-10-02 15:03:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1719. [2019-10-02 15:03:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-10-02 15:03:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2553 transitions. [2019-10-02 15:03:35,168 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2553 transitions. Word has length 158 [2019-10-02 15:03:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:35,169 INFO L475 AbstractCegarLoop]: Abstraction has 1719 states and 2553 transitions. [2019-10-02 15:03:35,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2553 transitions. [2019-10-02 15:03:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 15:03:35,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:35,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,176 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:35,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:35,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1399172685, now seen corresponding path program 1 times [2019-10-02 15:03:35,177 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:35,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:35,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:35,509 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 15:03:35,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:35,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:03:35,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:03:35,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:03:35,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:03:35,512 INFO L87 Difference]: Start difference. First operand 1719 states and 2553 transitions. Second operand 5 states. [2019-10-02 15:03:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:36,112 INFO L93 Difference]: Finished difference Result 4371 states and 6633 transitions. [2019-10-02 15:03:36,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:03:36,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-02 15:03:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:36,127 INFO L225 Difference]: With dead ends: 4371 [2019-10-02 15:03:36,127 INFO L226 Difference]: Without dead ends: 2835 [2019-10-02 15:03:36,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:03:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-10-02 15:03:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2833. [2019-10-02 15:03:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2019-10-02 15:03:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 4278 transitions. [2019-10-02 15:03:36,338 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 4278 transitions. Word has length 159 [2019-10-02 15:03:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:36,339 INFO L475 AbstractCegarLoop]: Abstraction has 2833 states and 4278 transitions. [2019-10-02 15:03:36,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:03:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 4278 transitions. [2019-10-02 15:03:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 15:03:36,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:36,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,344 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:36,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1519156504, now seen corresponding path program 1 times [2019-10-02 15:03:36,344 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:36,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:36,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:36,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:36,551 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 15:03:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:03:36,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:03:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:03:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:36,553 INFO L87 Difference]: Start difference. First operand 2833 states and 4278 transitions. Second operand 4 states. [2019-10-02 15:03:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:36,987 INFO L93 Difference]: Finished difference Result 7338 states and 11090 transitions. [2019-10-02 15:03:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:03:36,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-02 15:03:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:37,013 INFO L225 Difference]: With dead ends: 7338 [2019-10-02 15:03:37,013 INFO L226 Difference]: Without dead ends: 4536 [2019-10-02 15:03:37,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:03:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-02 15:03:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4513. [2019-10-02 15:03:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4513 states. [2019-10-02 15:03:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6769 transitions. [2019-10-02 15:03:37,387 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6769 transitions. Word has length 159 [2019-10-02 15:03:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:37,388 INFO L475 AbstractCegarLoop]: Abstraction has 4513 states and 6769 transitions. [2019-10-02 15:03:37,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:03:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6769 transitions. [2019-10-02 15:03:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 15:03:37,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:37,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,394 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:37,395 INFO L82 PathProgramCache]: Analyzing trace with hash 779025742, now seen corresponding path program 1 times [2019-10-02 15:03:37,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:37,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:37,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:37,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:37,516 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 15:03:37,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:37,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:37,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:37,519 INFO L87 Difference]: Start difference. First operand 4513 states and 6769 transitions. Second operand 3 states. [2019-10-02 15:03:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:37,952 INFO L93 Difference]: Finished difference Result 11128 states and 16749 transitions. [2019-10-02 15:03:37,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:37,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-02 15:03:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:37,987 INFO L225 Difference]: With dead ends: 11128 [2019-10-02 15:03:37,987 INFO L226 Difference]: Without dead ends: 6987 [2019-10-02 15:03:37,998 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:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2019-10-02 15:03:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6966. [2019-10-02 15:03:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-10-02 15:03:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 10335 transitions. [2019-10-02 15:03:38,466 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 10335 transitions. Word has length 161 [2019-10-02 15:03:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:38,467 INFO L475 AbstractCegarLoop]: Abstraction has 6966 states and 10335 transitions. [2019-10-02 15:03:38,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 10335 transitions. [2019-10-02 15:03:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 15:03:38,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:38,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,475 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -169339511, now seen corresponding path program 1 times [2019-10-02 15:03:38,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:38,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:38,563 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 15:03:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:38,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:38,565 INFO L87 Difference]: Start difference. First operand 6966 states and 10335 transitions. Second operand 3 states. [2019-10-02 15:03:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:39,262 INFO L93 Difference]: Finished difference Result 17929 states and 27059 transitions. [2019-10-02 15:03:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:39,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 15:03:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:39,300 INFO L225 Difference]: With dead ends: 17929 [2019-10-02 15:03:39,301 INFO L226 Difference]: Without dead ends: 11304 [2019-10-02 15:03:39,314 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:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2019-10-02 15:03:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 10364. [2019-10-02 15:03:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10364 states. [2019-10-02 15:03:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10364 states to 10364 states and 15734 transitions. [2019-10-02 15:03:39,894 INFO L78 Accepts]: Start accepts. Automaton has 10364 states and 15734 transitions. Word has length 165 [2019-10-02 15:03:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:39,894 INFO L475 AbstractCegarLoop]: Abstraction has 10364 states and 15734 transitions. [2019-10-02 15:03:39,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 10364 states and 15734 transitions. [2019-10-02 15:03:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 15:03:39,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:39,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,904 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:39,905 INFO L82 PathProgramCache]: Analyzing trace with hash 628802590, now seen corresponding path program 1 times [2019-10-02 15:03:39,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:39,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:39,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:39,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:40,120 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 15:03:40,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:40,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:03:40,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:03:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:03:40,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:03:40,121 INFO L87 Difference]: Start difference. First operand 10364 states and 15734 transitions. Second operand 8 states. [2019-10-02 15:03:40,530 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-10-02 15:03:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:42,880 INFO L93 Difference]: Finished difference Result 41170 states and 63107 transitions. [2019-10-02 15:03:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:03:42,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-10-02 15:03:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:42,955 INFO L225 Difference]: With dead ends: 41170 [2019-10-02 15:03:42,955 INFO L226 Difference]: Without dead ends: 31221 [2019-10-02 15:03:43,047 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-02 15:03:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31221 states. [2019-10-02 15:03:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31221 to 16912. [2019-10-02 15:03:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16912 states. [2019-10-02 15:03:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16912 states to 16912 states and 25456 transitions. [2019-10-02 15:03:44,121 INFO L78 Accepts]: Start accepts. Automaton has 16912 states and 25456 transitions. Word has length 166 [2019-10-02 15:03:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:44,121 INFO L475 AbstractCegarLoop]: Abstraction has 16912 states and 25456 transitions. [2019-10-02 15:03:44,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:03:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 16912 states and 25456 transitions. [2019-10-02 15:03:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 15:03:44,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:44,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,132 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:44,132 INFO L82 PathProgramCache]: Analyzing trace with hash -961444745, now seen corresponding path program 1 times [2019-10-02 15:03:44,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:44,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:44,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:44,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:44,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:44,447 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 15:03:44,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:44,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:03:44,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:03:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:03:44,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:44,448 INFO L87 Difference]: Start difference. First operand 16912 states and 25456 transitions. Second operand 4 states. [2019-10-02 15:03:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:46,283 INFO L93 Difference]: Finished difference Result 47014 states and 70541 transitions. [2019-10-02 15:03:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:03:46,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-02 15:03:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:46,347 INFO L225 Difference]: With dead ends: 47014 [2019-10-02 15:03:46,347 INFO L226 Difference]: Without dead ends: 30145 [2019-10-02 15:03:46,381 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:03:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30145 states. [2019-10-02 15:03:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30145 to 30107. [2019-10-02 15:03:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30107 states. [2019-10-02 15:03:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30107 states to 30107 states and 44602 transitions. [2019-10-02 15:03:47,904 INFO L78 Accepts]: Start accepts. Automaton has 30107 states and 44602 transitions. Word has length 166 [2019-10-02 15:03:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:47,905 INFO L475 AbstractCegarLoop]: Abstraction has 30107 states and 44602 transitions. [2019-10-02 15:03:47,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:03:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 30107 states and 44602 transitions. [2019-10-02 15:03:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 15:03:47,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:47,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,918 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash 155010953, now seen corresponding path program 1 times [2019-10-02 15:03:47,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:47,984 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 15:03:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:47,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:47,986 INFO L87 Difference]: Start difference. First operand 30107 states and 44602 transitions. Second operand 3 states. [2019-10-02 15:03:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:51,299 INFO L93 Difference]: Finished difference Result 90119 states and 133549 transitions. [2019-10-02 15:03:51,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:51,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 15:03:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:51,414 INFO L225 Difference]: With dead ends: 90119 [2019-10-02 15:03:51,415 INFO L226 Difference]: Without dead ends: 60122 [2019-10-02 15:03:51,473 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:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60122 states. [2019-10-02 15:03:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60122 to 30113. [2019-10-02 15:03:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30113 states. [2019-10-02 15:03:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30113 states to 30113 states and 44608 transitions. [2019-10-02 15:03:53,181 INFO L78 Accepts]: Start accepts. Automaton has 30113 states and 44608 transitions. Word has length 167 [2019-10-02 15:03:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:53,181 INFO L475 AbstractCegarLoop]: Abstraction has 30113 states and 44608 transitions. [2019-10-02 15:03:53,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 30113 states and 44608 transitions. [2019-10-02 15:03:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:03:53,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:53,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,193 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash -899511549, now seen corresponding path program 1 times [2019-10-02 15:03:53,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:53,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:53,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:53,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:53,307 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 15:03:53,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:53,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:53,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:53,309 INFO L87 Difference]: Start difference. First operand 30113 states and 44608 transitions. Second operand 3 states. [2019-10-02 15:03:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:56,641 INFO L93 Difference]: Finished difference Result 79104 states and 117010 transitions. [2019-10-02 15:03:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:56,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 15:03:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:56,722 INFO L225 Difference]: With dead ends: 79104 [2019-10-02 15:03:56,723 INFO L226 Difference]: Without dead ends: 49750 [2019-10-02 15:03:56,760 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:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49750 states. [2019-10-02 15:03:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49750 to 49712. [2019-10-02 15:03:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49712 states. [2019-10-02 15:03:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49712 states to 49712 states and 72594 transitions. [2019-10-02 15:03:59,419 INFO L78 Accepts]: Start accepts. Automaton has 49712 states and 72594 transitions. Word has length 168 [2019-10-02 15:03:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:59,420 INFO L475 AbstractCegarLoop]: Abstraction has 49712 states and 72594 transitions. [2019-10-02 15:03:59,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 49712 states and 72594 transitions. [2019-10-02 15:03:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:03:59,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:59,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,436 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1575562976, now seen corresponding path program 1 times [2019-10-02 15:03:59,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:59,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:59,596 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 15:03:59,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:59,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:03:59,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:03:59,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:03:59,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:59,599 INFO L87 Difference]: Start difference. First operand 49712 states and 72594 transitions. Second operand 4 states. [2019-10-02 15:04:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:01,880 INFO L93 Difference]: Finished difference Result 92973 states and 136026 transitions. [2019-10-02 15:04:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:04:01,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-02 15:04:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:01,946 INFO L225 Difference]: With dead ends: 92973 [2019-10-02 15:04:01,946 INFO L226 Difference]: Without dead ends: 43944 [2019-10-02 15:04:01,998 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:04:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43944 states. [2019-10-02 15:04:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43944 to 43944. [2019-10-02 15:04:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43944 states. [2019-10-02 15:04:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43944 states to 43944 states and 64219 transitions. [2019-10-02 15:04:05,661 INFO L78 Accepts]: Start accepts. Automaton has 43944 states and 64219 transitions. Word has length 168 [2019-10-02 15:04:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:05,661 INFO L475 AbstractCegarLoop]: Abstraction has 43944 states and 64219 transitions. [2019-10-02 15:04:05,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:04:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 43944 states and 64219 transitions. [2019-10-02 15:04:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 15:04:05,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:05,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,672 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash -21735439, now seen corresponding path program 1 times [2019-10-02 15:04:05,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:05,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:05,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:05,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:05,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:05,891 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 15:04:05,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:05,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:04:05,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:04:05,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:04:05,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:04:05,893 INFO L87 Difference]: Start difference. First operand 43944 states and 64219 transitions. Second operand 9 states. [2019-10-02 15:04:08,167 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-10-02 15:04:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:16,588 INFO L93 Difference]: Finished difference Result 184672 states and 272956 transitions. [2019-10-02 15:04:16,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 15:04:16,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-10-02 15:04:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:16,812 INFO L225 Difference]: With dead ends: 184672 [2019-10-02 15:04:16,812 INFO L226 Difference]: Without dead ends: 146947 [2019-10-02 15:04:16,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:04:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146947 states. [2019-10-02 15:04:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146947 to 80348. [2019-10-02 15:04:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80348 states. [2019-10-02 15:04:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80348 states to 80348 states and 118564 transitions. [2019-10-02 15:04:22,151 INFO L78 Accepts]: Start accepts. Automaton has 80348 states and 118564 transitions. Word has length 173 [2019-10-02 15:04:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:22,151 INFO L475 AbstractCegarLoop]: Abstraction has 80348 states and 118564 transitions. [2019-10-02 15:04:22,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:04:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 80348 states and 118564 transitions. [2019-10-02 15:04:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 15:04:22,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:22,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,166 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash 389804597, now seen corresponding path program 1 times [2019-10-02 15:04:22,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:22,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:22,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:22,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:22,316 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 15:04:22,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:22,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:04:22,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:04:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:04:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:04:22,318 INFO L87 Difference]: Start difference. First operand 80348 states and 118564 transitions. Second operand 4 states. [2019-10-02 15:04:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:25,583 INFO L93 Difference]: Finished difference Result 100779 states and 149713 transitions. [2019-10-02 15:04:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:04:25,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-02 15:04:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:25,648 INFO L225 Difference]: With dead ends: 100779 [2019-10-02 15:04:25,648 INFO L226 Difference]: Without dead ends: 53294 [2019-10-02 15:04:25,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:04:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53294 states. [2019-10-02 15:04:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53294 to 53292. [2019-10-02 15:04:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53292 states. [2019-10-02 15:04:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53292 states to 53292 states and 77618 transitions. [2019-10-02 15:04:30,584 INFO L78 Accepts]: Start accepts. Automaton has 53292 states and 77618 transitions. Word has length 173 [2019-10-02 15:04:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:30,585 INFO L475 AbstractCegarLoop]: Abstraction has 53292 states and 77618 transitions. [2019-10-02 15:04:30,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:04:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 53292 states and 77618 transitions. [2019-10-02 15:04:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 15:04:30,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:30,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,603 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1355272405, now seen corresponding path program 1 times [2019-10-02 15:04:30,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:30,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:30,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:30,729 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 15:04:30,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:30,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:04:30,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:04:30,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:04:30,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:04:30,731 INFO L87 Difference]: Start difference. First operand 53292 states and 77618 transitions. Second operand 3 states. [2019-10-02 15:04:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:36,655 INFO L93 Difference]: Finished difference Result 145796 states and 215558 transitions. [2019-10-02 15:04:36,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:04:36,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-10-02 15:04:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:36,785 INFO L225 Difference]: With dead ends: 145796 [2019-10-02 15:04:36,785 INFO L226 Difference]: Without dead ends: 103031 [2019-10-02 15:04:37,154 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:04:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103031 states. [2019-10-02 15:04:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103031 to 102819. [2019-10-02 15:04:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102819 states. [2019-10-02 15:04:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102819 states to 102819 states and 150258 transitions. [2019-10-02 15:04:45,203 INFO L78 Accepts]: Start accepts. Automaton has 102819 states and 150258 transitions. Word has length 173 [2019-10-02 15:04:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:45,204 INFO L475 AbstractCegarLoop]: Abstraction has 102819 states and 150258 transitions. [2019-10-02 15:04:45,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:04:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 102819 states and 150258 transitions. [2019-10-02 15:04:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 15:04:45,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:45,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,220 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1354933781, now seen corresponding path program 1 times [2019-10-02 15:04:45,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:45,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:45,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:45,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:45,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:45,365 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 15:04:45,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:45,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:04:45,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:04:45,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:04:45,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:04:45,366 INFO L87 Difference]: Start difference. First operand 102819 states and 150258 transitions. Second operand 4 states. [2019-10-02 15:04:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:54,203 INFO L93 Difference]: Finished difference Result 187851 states and 278090 transitions. [2019-10-02 15:04:54,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:04:54,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-02 15:04:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:54,390 INFO L225 Difference]: With dead ends: 187851 [2019-10-02 15:04:54,390 INFO L226 Difference]: Without dead ends: 140962 [2019-10-02 15:04:54,447 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:04:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140962 states. [2019-10-02 15:05:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140962 to 100069. [2019-10-02 15:05:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100069 states. [2019-10-02 15:05:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100069 states to 100069 states and 146844 transitions. [2019-10-02 15:05:04,648 INFO L78 Accepts]: Start accepts. Automaton has 100069 states and 146844 transitions. Word has length 173 [2019-10-02 15:05:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:04,649 INFO L475 AbstractCegarLoop]: Abstraction has 100069 states and 146844 transitions. [2019-10-02 15:05:04,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 100069 states and 146844 transitions. [2019-10-02 15:05:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 15:05:04,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:04,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,663 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash -4980633, now seen corresponding path program 1 times [2019-10-02 15:05:04,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:04,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:04,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:04,841 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 15:05:04,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:04,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:05:04,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:05:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:05:04,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:05:04,843 INFO L87 Difference]: Start difference. First operand 100069 states and 146844 transitions. Second operand 8 states. [2019-10-02 15:05:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:21,444 INFO L93 Difference]: Finished difference Result 267561 states and 392021 transitions. [2019-10-02 15:05:21,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:05:21,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-10-02 15:05:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:21,763 INFO L225 Difference]: With dead ends: 267561 [2019-10-02 15:05:21,764 INFO L226 Difference]: Without dead ends: 228383 [2019-10-02 15:05:21,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-02 15:05:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228383 states. [2019-10-02 15:05:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228383 to 98857. [2019-10-02 15:05:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98857 states. [2019-10-02 15:05:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98857 states to 98857 states and 144531 transitions. [2019-10-02 15:05:30,390 INFO L78 Accepts]: Start accepts. Automaton has 98857 states and 144531 transitions. Word has length 173 [2019-10-02 15:05:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:30,391 INFO L475 AbstractCegarLoop]: Abstraction has 98857 states and 144531 transitions. [2019-10-02 15:05:30,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:05:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 98857 states and 144531 transitions. [2019-10-02 15:05:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 15:05:30,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:30,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,410 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -558569781, now seen corresponding path program 1 times [2019-10-02 15:05:30,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:30,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:30,595 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 15:05:30,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:30,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:30,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:30,597 INFO L87 Difference]: Start difference. First operand 98857 states and 144531 transitions. Second operand 4 states. [2019-10-02 15:05:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:39,279 INFO L93 Difference]: Finished difference Result 190209 states and 278126 transitions. [2019-10-02 15:05:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:05:39,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-02 15:05:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:39,389 INFO L225 Difference]: With dead ends: 190209 [2019-10-02 15:05:39,389 INFO L226 Difference]: Without dead ends: 91646 [2019-10-02 15:05:39,443 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:05:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91646 states. [2019-10-02 15:05:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91646 to 91576. [2019-10-02 15:05:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91576 states. [2019-10-02 15:05:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91576 states to 91576 states and 133853 transitions. [2019-10-02 15:05:48,944 INFO L78 Accepts]: Start accepts. Automaton has 91576 states and 133853 transitions. Word has length 173 [2019-10-02 15:05:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:48,945 INFO L475 AbstractCegarLoop]: Abstraction has 91576 states and 133853 transitions. [2019-10-02 15:05:48,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 91576 states and 133853 transitions. [2019-10-02 15:05:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 15:05:48,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:48,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,962 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1029021133, now seen corresponding path program 1 times [2019-10-02 15:05:48,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:48,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:48,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:48,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:48,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:49,178 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 15:05:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:49,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:49,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:49,180 INFO L87 Difference]: Start difference. First operand 91576 states and 133853 transitions. Second operand 4 states. [2019-10-02 15:05:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:56,843 INFO L93 Difference]: Finished difference Result 183218 states and 267781 transitions. [2019-10-02 15:05:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:05:56,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-10-02 15:05:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:56,952 INFO L225 Difference]: With dead ends: 183218 [2019-10-02 15:05:56,952 INFO L226 Difference]: Without dead ends: 91803 [2019-10-02 15:05:57,009 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:05:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91803 states. [2019-10-02 15:06:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91803 to 91679. [2019-10-02 15:06:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91679 states. [2019-10-02 15:06:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91679 states to 91679 states and 133957 transitions. [2019-10-02 15:06:04,811 INFO L78 Accepts]: Start accepts. Automaton has 91679 states and 133957 transitions. Word has length 175 [2019-10-02 15:06:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:04,812 INFO L475 AbstractCegarLoop]: Abstraction has 91679 states and 133957 transitions. [2019-10-02 15:06:04,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:06:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 91679 states and 133957 transitions. [2019-10-02 15:06:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 15:06:04,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:04,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,824 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1901100747, now seen corresponding path program 1 times [2019-10-02 15:06:04,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:04,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:04,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:04,892 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 15:06:04,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:04,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:06:04,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:06:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:06:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:06:04,893 INFO L87 Difference]: Start difference. First operand 91679 states and 133957 transitions. Second operand 3 states. [2019-10-02 15:06:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:20,173 INFO L93 Difference]: Finished difference Result 256779 states and 375321 transitions. [2019-10-02 15:06:20,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:06:20,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-02 15:06:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:20,417 INFO L225 Difference]: With dead ends: 256779 [2019-10-02 15:06:20,418 INFO L226 Difference]: Without dead ends: 183144 [2019-10-02 15:06:20,482 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:06:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183144 states. [2019-10-02 15:06:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183144 to 91689. [2019-10-02 15:06:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91689 states. [2019-10-02 15:06:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91689 states to 91689 states and 133967 transitions. [2019-10-02 15:06:29,153 INFO L78 Accepts]: Start accepts. Automaton has 91689 states and 133967 transitions. Word has length 176 [2019-10-02 15:06:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:29,154 INFO L475 AbstractCegarLoop]: Abstraction has 91689 states and 133967 transitions. [2019-10-02 15:06:29,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:06:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 91689 states and 133967 transitions. [2019-10-02 15:06:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 15:06:29,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:29,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,167 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash -356471203, now seen corresponding path program 1 times [2019-10-02 15:06:29,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:29,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:29,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:29,350 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 15:06:29,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:29,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:06:29,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:06:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:06:29,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:06:29,352 INFO L87 Difference]: Start difference. First operand 91689 states and 133967 transitions. Second operand 4 states. [2019-10-02 15:06:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:40,174 INFO L93 Difference]: Finished difference Result 183576 states and 268144 transitions. [2019-10-02 15:06:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:06:40,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-10-02 15:06:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:40,296 INFO L225 Difference]: With dead ends: 183576 [2019-10-02 15:06:40,296 INFO L226 Difference]: Without dead ends: 92159 [2019-10-02 15:06:40,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92159 states. [2019-10-02 15:06:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92159 to 91940. [2019-10-02 15:06:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91940 states. [2019-10-02 15:06:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91940 states to 91940 states and 134223 transitions. [2019-10-02 15:06:48,217 INFO L78 Accepts]: Start accepts. Automaton has 91940 states and 134223 transitions. Word has length 177 [2019-10-02 15:06:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:48,218 INFO L475 AbstractCegarLoop]: Abstraction has 91940 states and 134223 transitions. [2019-10-02 15:06:48,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:06:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 91940 states and 134223 transitions. [2019-10-02 15:06:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 15:06:48,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:48,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,230 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:48,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2052609364, now seen corresponding path program 1 times [2019-10-02 15:06:48,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:48,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:48,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:48,370 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 15:06:48,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:48,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:06:48,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:06:48,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:06:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:06:48,371 INFO L87 Difference]: Start difference. First operand 91940 states and 134223 transitions. Second operand 4 states. [2019-10-02 15:06:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:56,353 INFO L93 Difference]: Finished difference Result 135255 states and 197492 transitions. [2019-10-02 15:06:56,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:06:56,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-10-02 15:06:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:56,447 INFO L225 Difference]: With dead ends: 135255 [2019-10-02 15:06:56,448 INFO L226 Difference]: Without dead ends: 83756 [2019-10-02 15:06:56,490 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:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83756 states. [2019-10-02 15:07:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83756 to 83753. [2019-10-02 15:07:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83753 states. [2019-10-02 15:07:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83753 states to 83753 states and 122334 transitions. [2019-10-02 15:07:06,766 INFO L78 Accepts]: Start accepts. Automaton has 83753 states and 122334 transitions. Word has length 177 [2019-10-02 15:07:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:06,766 INFO L475 AbstractCegarLoop]: Abstraction has 83753 states and 122334 transitions. [2019-10-02 15:07:06,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:07:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 83753 states and 122334 transitions. [2019-10-02 15:07:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:07:06,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:06,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:06,778 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -416612640, now seen corresponding path program 1 times [2019-10-02 15:07:06,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:06,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:06,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:06,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:06,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:07,121 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 15:07:07,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:07:07,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 15:07:07,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 15:07:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 15:07:07,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:07:07,123 INFO L87 Difference]: Start difference. First operand 83753 states and 122334 transitions. Second operand 11 states. [2019-10-02 15:07:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:07:53,730 INFO L93 Difference]: Finished difference Result 469007 states and 688329 transitions. [2019-10-02 15:07:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 15:07:53,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-10-02 15:07:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:07:54,338 INFO L225 Difference]: With dead ends: 469007 [2019-10-02 15:07:54,339 INFO L226 Difference]: Without dead ends: 397278 [2019-10-02 15:07:54,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2019-10-02 15:07:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397278 states. [2019-10-02 15:08:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397278 to 275138. [2019-10-02 15:08:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275138 states. [2019-10-02 15:08:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275138 states to 275138 states and 403123 transitions. [2019-10-02 15:08:28,700 INFO L78 Accepts]: Start accepts. Automaton has 275138 states and 403123 transitions. Word has length 179 [2019-10-02 15:08:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:08:28,700 INFO L475 AbstractCegarLoop]: Abstraction has 275138 states and 403123 transitions. [2019-10-02 15:08:28,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 15:08:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 275138 states and 403123 transitions. [2019-10-02 15:08:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:08:28,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:08:28,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:28,732 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:08:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:08:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2112377291, now seen corresponding path program 1 times [2019-10-02 15:08:28,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:08:28,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:08:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:28,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:08:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:08:29,014 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 15:08:29,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:08:29,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:08:29,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:08:29,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:08:29,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:08:29,015 INFO L87 Difference]: Start difference. First operand 275138 states and 403123 transitions. Second operand 9 states. [2019-10-02 15:08:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:58,587 INFO L93 Difference]: Finished difference Result 500063 states and 737020 transitions. [2019-10-02 15:08:58,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:08:58,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-02 15:08:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:58,948 INFO L225 Difference]: With dead ends: 500063 [2019-10-02 15:08:58,948 INFO L226 Difference]: Without dead ends: 234284 [2019-10-02 15:08:59,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 15:08:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234284 states. [2019-10-02 15:09:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234284 to 163705. [2019-10-02 15:09:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163705 states. [2019-10-02 15:09:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163705 states to 163705 states and 237810 transitions. [2019-10-02 15:09:22,000 INFO L78 Accepts]: Start accepts. Automaton has 163705 states and 237810 transitions. Word has length 179 [2019-10-02 15:09:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:22,000 INFO L475 AbstractCegarLoop]: Abstraction has 163705 states and 237810 transitions. [2019-10-02 15:09:22,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:09:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 163705 states and 237810 transitions. [2019-10-02 15:09:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:09:22,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:22,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:22,019 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1424133253, now seen corresponding path program 1 times [2019-10-02 15:09:22,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:22,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:22,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:22,190 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 15:09:22,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:22,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:09:22,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:09:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:09:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:09:22,192 INFO L87 Difference]: Start difference. First operand 163705 states and 237810 transitions. Second operand 8 states. [2019-10-02 15:10:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:05,552 INFO L93 Difference]: Finished difference Result 434221 states and 628918 transitions. [2019-10-02 15:10:05,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:10:05,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-10-02 15:10:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:06,132 INFO L225 Difference]: With dead ends: 434221 [2019-10-02 15:10:06,133 INFO L226 Difference]: Without dead ends: 381804 [2019-10-02 15:10:06,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-02 15:10:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381804 states. [2019-10-02 15:10:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381804 to 185559. [2019-10-02 15:10:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185559 states. [2019-10-02 15:10:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185559 states to 185559 states and 270604 transitions. [2019-10-02 15:10:35,195 INFO L78 Accepts]: Start accepts. Automaton has 185559 states and 270604 transitions. Word has length 179 [2019-10-02 15:10:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:35,196 INFO L475 AbstractCegarLoop]: Abstraction has 185559 states and 270604 transitions. [2019-10-02 15:10:35,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:10:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 185559 states and 270604 transitions. [2019-10-02 15:10:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:10:35,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:35,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:35,220 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1104856678, now seen corresponding path program 1 times [2019-10-02 15:10:35,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:35,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:35,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:35,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:35,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:35,355 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 15:10:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:10:35,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:10:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:10:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:10:35,357 INFO L87 Difference]: Start difference. First operand 185559 states and 270604 transitions. Second operand 4 states. [2019-10-02 15:10:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:57,277 INFO L93 Difference]: Finished difference Result 343175 states and 508375 transitions. [2019-10-02 15:10:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:10:57,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-10-02 15:10:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:57,529 INFO L225 Difference]: With dead ends: 343175 [2019-10-02 15:10:57,529 INFO L226 Difference]: Without dead ends: 185561 [2019-10-02 15:10:57,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:10:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185561 states. [2019-10-02 15:11:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185561 to 185559. [2019-10-02 15:11:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185559 states. [2019-10-02 15:11:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185559 states to 185559 states and 270013 transitions. [2019-10-02 15:11:22,493 INFO L78 Accepts]: Start accepts. Automaton has 185559 states and 270013 transitions. Word has length 179 [2019-10-02 15:11:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:22,494 INFO L475 AbstractCegarLoop]: Abstraction has 185559 states and 270013 transitions. [2019-10-02 15:11:22,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:11:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 185559 states and 270013 transitions. [2019-10-02 15:11:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:11:22,518 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:22,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:22,519 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash -134206905, now seen corresponding path program 1 times [2019-10-02 15:11:22,519 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:22,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:22,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:23,315 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-02 15:11:24,080 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 15:11:24,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:24,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 15:11:24,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 15:11:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 15:11:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2019-10-02 15:11:24,082 INFO L87 Difference]: Start difference. First operand 185559 states and 270013 transitions. Second operand 22 states. [2019-10-02 15:11:25,283 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 15:11:25,447 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-02 15:11:25,696 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-02 15:11:25,925 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-02 15:11:26,166 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-02 15:11:26,358 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-02 15:11:26,535 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-02 15:11:26,747 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-10-02 15:11:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:55,735 INFO L93 Difference]: Finished difference Result 273229 states and 399960 transitions. [2019-10-02 15:11:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 15:11:55,736 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 179 [2019-10-02 15:11:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:56,021 INFO L225 Difference]: With dead ends: 273229 [2019-10-02 15:11:56,022 INFO L226 Difference]: Without dead ends: 209128 [2019-10-02 15:11:56,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 15:11:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209128 states. [2019-10-02 15:12:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209128 to 186127. [2019-10-02 15:12:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186127 states. [2019-10-02 15:12:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186127 states to 186127 states and 270678 transitions. [2019-10-02 15:12:22,071 INFO L78 Accepts]: Start accepts. Automaton has 186127 states and 270678 transitions. Word has length 179 [2019-10-02 15:12:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:12:22,072 INFO L475 AbstractCegarLoop]: Abstraction has 186127 states and 270678 transitions. [2019-10-02 15:12:22,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 15:12:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 186127 states and 270678 transitions. [2019-10-02 15:12:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:12:22,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:12:22,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:22,096 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:12:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:12:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1196094542, now seen corresponding path program 1 times [2019-10-02 15:12:22,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:12:22,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:12:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:22,236 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 15:12:22,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:12:22,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:12:22,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:12:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:12:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:12:22,238 INFO L87 Difference]: Start difference. First operand 186127 states and 270678 transitions. Second operand 4 states. [2019-10-02 15:12:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:12:40,139 INFO L93 Difference]: Finished difference Result 304732 states and 449592 transitions. [2019-10-02 15:12:40,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:12:40,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-10-02 15:12:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:12:40,340 INFO L225 Difference]: With dead ends: 304732 [2019-10-02 15:12:40,340 INFO L226 Difference]: Without dead ends: 146783 [2019-10-02 15:12:40,454 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:12:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146783 states. [2019-10-02 15:13:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146783 to 146781. [2019-10-02 15:13:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146781 states. [2019-10-02 15:13:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146781 states to 146781 states and 211112 transitions. [2019-10-02 15:13:01,167 INFO L78 Accepts]: Start accepts. Automaton has 146781 states and 211112 transitions. Word has length 179 [2019-10-02 15:13:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:13:01,167 INFO L475 AbstractCegarLoop]: Abstraction has 146781 states and 211112 transitions. [2019-10-02 15:13:01,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:13:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 146781 states and 211112 transitions. [2019-10-02 15:13:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:13:01,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:13:01,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:01,195 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:13:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:13:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2016830033, now seen corresponding path program 1 times [2019-10-02 15:13:01,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:13:01,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:13:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:01,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:13:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:13:02,493 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 15:13:02,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:13:02,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-02 15:13:02,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 15:13:02,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 15:13:02,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-02 15:13:02,495 INFO L87 Difference]: Start difference. First operand 146781 states and 211112 transitions. Second operand 21 states. [2019-10-02 15:13:03,126 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-10-02 15:13:03,287 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-10-02 15:13:03,680 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-02 15:13:03,882 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-02 15:13:04,216 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-10-02 15:13:04,373 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-10-02 15:13:05,394 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2019-10-02 15:13:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:13:29,634 INFO L93 Difference]: Finished difference Result 243081 states and 350657 transitions. [2019-10-02 15:13:29,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 15:13:29,635 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-10-02 15:13:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:13:29,856 INFO L225 Difference]: With dead ends: 243081 [2019-10-02 15:13:29,857 INFO L226 Difference]: Without dead ends: 174816 [2019-10-02 15:13:29,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 15:13:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174816 states. [2019-10-02 15:13:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174816 to 147422. [2019-10-02 15:13:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147422 states. [2019-10-02 15:13:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147422 states to 147422 states and 211855 transitions. [2019-10-02 15:13:51,179 INFO L78 Accepts]: Start accepts. Automaton has 147422 states and 211855 transitions. Word has length 179 [2019-10-02 15:13:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:13:51,179 INFO L475 AbstractCegarLoop]: Abstraction has 147422 states and 211855 transitions. [2019-10-02 15:13:51,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 15:13:51,180 INFO L276 IsEmpty]: Start isEmpty. Operand 147422 states and 211855 transitions. [2019-10-02 15:13:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 15:13:51,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:13:51,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:51,209 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:13:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:13:51,209 INFO L82 PathProgramCache]: Analyzing trace with hash -955317430, now seen corresponding path program 1 times [2019-10-02 15:13:51,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:13:51,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:13:51,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:51,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:13:51,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:13:51,280 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 15:13:51,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:13:51,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:13:51,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:13:51,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:13:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:13:51,286 INFO L87 Difference]: Start difference. First operand 147422 states and 211855 transitions. Second operand 3 states. [2019-10-02 15:14:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:14:08,938 INFO L93 Difference]: Finished difference Result 253579 states and 365068 transitions. [2019-10-02 15:14:08,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:14:08,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 15:14:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:14:09,128 INFO L225 Difference]: With dead ends: 253579 [2019-10-02 15:14:09,129 INFO L226 Difference]: Without dead ends: 146623 [2019-10-02 15:14:09,211 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:14:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146623 states. [2019-10-02 15:14:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146623 to 146623. [2019-10-02 15:14:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146623 states. [2019-10-02 15:14:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146623 states to 146623 states and 210247 transitions. [2019-10-02 15:14:25,662 INFO L78 Accepts]: Start accepts. Automaton has 146623 states and 210247 transitions. Word has length 180 [2019-10-02 15:14:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:14:25,663 INFO L475 AbstractCegarLoop]: Abstraction has 146623 states and 210247 transitions. [2019-10-02 15:14:25,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:14:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 146623 states and 210247 transitions. [2019-10-02 15:14:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 15:14:25,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:14:25,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:25,688 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:14:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:14:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1529855349, now seen corresponding path program 1 times [2019-10-02 15:14:25,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:14:25,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:14:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:14:25,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:14:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:14:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:14:25,770 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 15:14:25,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:14:25,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:14:25,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:14:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:14:25,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:14:25,771 INFO L87 Difference]: Start difference. First operand 146623 states and 210247 transitions. Second operand 3 states. [2019-10-02 15:14:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:14:47,743 INFO L93 Difference]: Finished difference Result 255590 states and 365228 transitions. [2019-10-02 15:14:47,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:14:47,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 15:14:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:14:47,959 INFO L225 Difference]: With dead ends: 255590 [2019-10-02 15:14:47,959 INFO L226 Difference]: Without dead ends: 157227 [2019-10-02 15:14:48,031 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:14:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157227 states. [2019-10-02 15:15:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157227 to 146119. [2019-10-02 15:15:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146119 states. [2019-10-02 15:15:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146119 states to 146119 states and 208364 transitions. [2019-10-02 15:15:04,843 INFO L78 Accepts]: Start accepts. Automaton has 146119 states and 208364 transitions. Word has length 180 [2019-10-02 15:15:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:15:04,843 INFO L475 AbstractCegarLoop]: Abstraction has 146119 states and 208364 transitions. [2019-10-02 15:15:04,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:15:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 146119 states and 208364 transitions. [2019-10-02 15:15:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 15:15:04,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:15:04,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,867 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:15:04,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:15:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash -694171946, now seen corresponding path program 1 times [2019-10-02 15:15:04,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:15:04,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:15:04,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:04,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:15:04,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:15:04,946 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 15:15:04,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:15:04,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:15:04,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:15:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:15:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:15:04,947 INFO L87 Difference]: Start difference. First operand 146119 states and 208364 transitions. Second operand 3 states. [2019-10-02 15:15:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:15:24,252 INFO L93 Difference]: Finished difference Result 259648 states and 369324 transitions. [2019-10-02 15:15:24,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:15:24,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 15:15:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:15:24,463 INFO L225 Difference]: With dead ends: 259648 [2019-10-02 15:15:24,463 INFO L226 Difference]: Without dead ends: 160229 [2019-10-02 15:15:24,551 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:15:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160229 states. [2019-10-02 15:15:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160229 to 144357. [2019-10-02 15:15:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144357 states. [2019-10-02 15:15:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144357 states to 144357 states and 205816 transitions. [2019-10-02 15:15:41,119 INFO L78 Accepts]: Start accepts. Automaton has 144357 states and 205816 transitions. Word has length 180 [2019-10-02 15:15:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:15:41,120 INFO L475 AbstractCegarLoop]: Abstraction has 144357 states and 205816 transitions. [2019-10-02 15:15:41,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:15:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 144357 states and 205816 transitions. [2019-10-02 15:15:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 15:15:41,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:15:41,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:41,144 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:15:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:15:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash 389964871, now seen corresponding path program 1 times [2019-10-02 15:15:41,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:15:41,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:15:41,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:41,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:15:41,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:15:41,225 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 15:15:41,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:15:41,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:15:41,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:15:41,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:15:41,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:15:41,227 INFO L87 Difference]: Start difference. First operand 144357 states and 205816 transitions. Second operand 3 states.