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.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 15:09:33,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 15:09:33,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 15:09:33,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 15:09:33,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 15:09:33,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 15:09:33,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 15:09:33,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 15:09:33,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 15:09:33,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 15:09:33,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 15:09:33,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 15:09:33,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 15:09:33,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 15:09:33,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 15:09:33,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 15:09:33,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 15:09:33,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 15:09:33,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 15:09:33,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 15:09:33,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 15:09:33,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 15:09:33,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 15:09:33,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 15:09:33,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 15:09:33,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 15:09:33,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 15:09:33,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 15:09:33,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 15:09:33,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 15:09:33,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 15:09:33,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 15:09:33,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 15:09:33,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 15:09:33,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 15:09:33,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 15:09:33,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 15:09:33,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 15:09:33,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 15:09:33,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 15:09:33,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 15:09:33,955 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:09:33,990 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 15:09:33,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 15:09:33,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 15:09:33,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 15:09:33,995 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 15:09:33,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 15:09:33,995 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 15:09:33,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 15:09:33,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 15:09:33,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 15:09:33,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 15:09:33,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 15:09:33,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 15:09:33,997 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 15:09:33,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 15:09:33,998 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 15:09:33,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 15:09:33,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 15:09:33,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 15:09:33,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 15:09:33,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 15:09:33,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:09:33,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 15:09:34,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 15:09:34,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 15:09:34,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 15:09:34,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 15:09:34,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 15:09:34,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 15:09:34,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 15:09:34,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 15:09:34,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 15:09:34,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 15:09:34,050 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 15:09:34,051 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.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 15:09:34,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305b17b99/80ded23a890943249c9bbce4c6573b45/FLAGd3042d6ac [2019-10-02 15:09:34,720 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 15:09:34,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 15:09:34,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305b17b99/80ded23a890943249c9bbce4c6573b45/FLAGd3042d6ac [2019-10-02 15:09:34,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305b17b99/80ded23a890943249c9bbce4c6573b45 [2019-10-02 15:09:34,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 15:09:34,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 15:09:34,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 15:09:34,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 15:09:34,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 15:09:34,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:09:34" (1/1) ... [2019-10-02 15:09:34,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6344516b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:34, skipping insertion in model container [2019-10-02 15:09:34,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:09:34" (1/1) ... [2019-10-02 15:09:34,985 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 15:09:35,066 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 15:09:35,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:09:35,778 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 15:09:36,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:09:36,237 INFO L192 MainTranslator]: Completed translation [2019-10-02 15:09:36,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36 WrapperNode [2019-10-02 15:09:36,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 15:09:36,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 15:09:36,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 15:09:36,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 15:09:36,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (1/1) ... [2019-10-02 15:09:36,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 15:09:36,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 15:09:36,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 15:09:36,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 15:09:36,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (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:09:36,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 15:09:36,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 15:09:36,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 15:09:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 15:09:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 15:09:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 15:09:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 15:09:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 15:09:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 15:09:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 15:09:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 15:09:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 15:09:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 15:09:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 15:09:36,425 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 15:09:36,425 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 15:09:36,428 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 15:09:36,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 15:09:36,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 15:09:38,300 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 15:09:38,301 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 15:09:38,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:09:38 BoogieIcfgContainer [2019-10-02 15:09:38,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 15:09:38,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 15:09:38,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 15:09:38,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 15:09:38,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 03:09:34" (1/3) ... [2019-10-02 15:09:38,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e2e7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:09:38, skipping insertion in model container [2019-10-02 15:09:38,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:09:36" (2/3) ... [2019-10-02 15:09:38,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e2e7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:09:38, skipping insertion in model container [2019-10-02 15:09:38,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:09:38" (3/3) ... [2019-10-02 15:09:38,316 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 15:09:38,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 15:09:38,341 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-02 15:09:38,361 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-02 15:09:38,407 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 15:09:38,407 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 15:09:38,407 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 15:09:38,408 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 15:09:38,408 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 15:09:38,408 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 15:09:38,408 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 15:09:38,408 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 15:09:38,408 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 15:09:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states. [2019-10-02 15:09:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 15:09:38,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:38,451 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] [2019-10-02 15:09:38,453 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:38,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash 257827157, now seen corresponding path program 1 times [2019-10-02 15:09:38,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:38,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:39,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:09:39,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:39,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:39,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:39,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:39,178 INFO L87 Difference]: Start difference. First operand 416 states. Second operand 3 states. [2019-10-02 15:09:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:39,409 INFO L93 Difference]: Finished difference Result 759 states and 1331 transitions. [2019-10-02 15:09:39,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:39,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-02 15:09:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:39,432 INFO L225 Difference]: With dead ends: 759 [2019-10-02 15:09:39,432 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 15:09:39,437 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:09:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 15:09:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-10-02 15:09:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 15:09:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 857 transitions. [2019-10-02 15:09:39,593 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 857 transitions. Word has length 151 [2019-10-02 15:09:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:39,596 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 857 transitions. [2019-10-02 15:09:39,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 857 transitions. [2019-10-02 15:09:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 15:09:39,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:39,607 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] [2019-10-02 15:09:39,608 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1201169525, now seen corresponding path program 1 times [2019-10-02 15:09:39,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:39,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:39,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:39,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:39,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:39,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:39,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:39,871 INFO L87 Difference]: Start difference. First operand 588 states and 857 transitions. Second operand 3 states. [2019-10-02 15:09:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:40,033 INFO L93 Difference]: Finished difference Result 1187 states and 1790 transitions. [2019-10-02 15:09:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:40,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-02 15:09:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:40,040 INFO L225 Difference]: With dead ends: 1187 [2019-10-02 15:09:40,041 INFO L226 Difference]: Without dead ends: 964 [2019-10-02 15:09:40,044 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:09:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-10-02 15:09:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2019-10-02 15:09:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-02 15:09:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1427 transitions. [2019-10-02 15:09:40,086 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1427 transitions. Word has length 151 [2019-10-02 15:09:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:40,087 INFO L475 AbstractCegarLoop]: Abstraction has 962 states and 1427 transitions. [2019-10-02 15:09:40,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1427 transitions. [2019-10-02 15:09:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 15:09:40,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:40,091 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] [2019-10-02 15:09:40,092 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1200830901, now seen corresponding path program 1 times [2019-10-02 15:09:40,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:40,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:40,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:40,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:40,526 INFO L87 Difference]: Start difference. First operand 962 states and 1427 transitions. Second operand 4 states. [2019-10-02 15:09:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:40,739 INFO L93 Difference]: Finished difference Result 2828 states and 4188 transitions. [2019-10-02 15:09:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:40,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-02 15:09:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:40,762 INFO L225 Difference]: With dead ends: 2828 [2019-10-02 15:09:40,762 INFO L226 Difference]: Without dead ends: 1879 [2019-10-02 15:09:40,768 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:09:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-10-02 15:09:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1837. [2019-10-02 15:09:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-10-02 15:09:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2717 transitions. [2019-10-02 15:09:40,910 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2717 transitions. Word has length 151 [2019-10-02 15:09:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:40,911 INFO L475 AbstractCegarLoop]: Abstraction has 1837 states and 2717 transitions. [2019-10-02 15:09:40,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2717 transitions. [2019-10-02 15:09:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 15:09:40,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:40,918 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:09:40,918 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:40,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash -958267271, now seen corresponding path program 1 times [2019-10-02 15:09:40,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:41,019 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:41,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:41,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:41,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:41,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:41,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:41,021 INFO L87 Difference]: Start difference. First operand 1837 states and 2717 transitions. Second operand 3 states. [2019-10-02 15:09:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:41,227 INFO L93 Difference]: Finished difference Result 5465 states and 8081 transitions. [2019-10-02 15:09:41,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:41,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-02 15:09:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:41,247 INFO L225 Difference]: With dead ends: 5465 [2019-10-02 15:09:41,247 INFO L226 Difference]: Without dead ends: 3660 [2019-10-02 15:09:41,251 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:09:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-10-02 15:09:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 1839. [2019-10-02 15:09:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-10-02 15:09:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2719 transitions. [2019-10-02 15:09:41,364 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2719 transitions. Word has length 152 [2019-10-02 15:09:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:41,364 INFO L475 AbstractCegarLoop]: Abstraction has 1839 states and 2719 transitions. [2019-10-02 15:09:41,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2719 transitions. [2019-10-02 15:09:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 15:09:41,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:41,368 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:09:41,369 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1744211523, now seen corresponding path program 1 times [2019-10-02 15:09:41,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:41,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:41,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:41,477 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:41,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:41,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:41,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:41,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:41,479 INFO L87 Difference]: Start difference. First operand 1839 states and 2719 transitions. Second operand 3 states. [2019-10-02 15:09:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:41,738 INFO L93 Difference]: Finished difference Result 5196 states and 7684 transitions. [2019-10-02 15:09:41,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:41,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-02 15:09:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:41,763 INFO L225 Difference]: With dead ends: 5196 [2019-10-02 15:09:41,763 INFO L226 Difference]: Without dead ends: 3554 [2019-10-02 15:09:41,769 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:09:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2019-10-02 15:09:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3512. [2019-10-02 15:09:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-10-02 15:09:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5152 transitions. [2019-10-02 15:09:42,011 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5152 transitions. Word has length 153 [2019-10-02 15:09:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:42,012 INFO L475 AbstractCegarLoop]: Abstraction has 3512 states and 5152 transitions. [2019-10-02 15:09:42,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5152 transitions. [2019-10-02 15:09:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 15:09:42,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:42,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] [2019-10-02 15:09:42,020 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:42,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:42,020 INFO L82 PathProgramCache]: Analyzing trace with hash 294713414, now seen corresponding path program 1 times [2019-10-02 15:09:42,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:42,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:42,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:42,345 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:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:42,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:42,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:42,346 INFO L87 Difference]: Start difference. First operand 3512 states and 5152 transitions. Second operand 4 states. [2019-10-02 15:09:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:42,500 INFO L93 Difference]: Finished difference Result 6017 states and 8836 transitions. [2019-10-02 15:09:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:42,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-02 15:09:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:42,514 INFO L225 Difference]: With dead ends: 6017 [2019-10-02 15:09:42,515 INFO L226 Difference]: Without dead ends: 2690 [2019-10-02 15:09:42,521 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:09:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2019-10-02 15:09:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2019-10-02 15:09:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2019-10-02 15:09:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3933 transitions. [2019-10-02 15:09:42,659 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3933 transitions. Word has length 153 [2019-10-02 15:09:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:42,659 INFO L475 AbstractCegarLoop]: Abstraction has 2690 states and 3933 transitions. [2019-10-02 15:09:42,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3933 transitions. [2019-10-02 15:09:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 15:09:42,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:42,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,664 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:42,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2083946363, now seen corresponding path program 1 times [2019-10-02 15:09:42,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:42,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:42,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:42,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:42,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:42,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:42,758 INFO L87 Difference]: Start difference. First operand 2690 states and 3933 transitions. Second operand 3 states. [2019-10-02 15:09:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:42,988 INFO L93 Difference]: Finished difference Result 6148 states and 9216 transitions. [2019-10-02 15:09:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:42,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-10-02 15:09:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:43,011 INFO L225 Difference]: With dead ends: 6148 [2019-10-02 15:09:43,011 INFO L226 Difference]: Without dead ends: 3644 [2019-10-02 15:09:43,019 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:09:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-10-02 15:09:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3558. [2019-10-02 15:09:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-10-02 15:09:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5350 transitions. [2019-10-02 15:09:43,249 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5350 transitions. Word has length 154 [2019-10-02 15:09:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:43,249 INFO L475 AbstractCegarLoop]: Abstraction has 3558 states and 5350 transitions. [2019-10-02 15:09:43,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:09:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5350 transitions. [2019-10-02 15:09:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 15:09:43,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:43,257 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] [2019-10-02 15:09:43,258 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash -564593784, now seen corresponding path program 1 times [2019-10-02 15:09:43,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:43,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:43,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:43,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:43,669 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:43,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:43,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 15:09:43,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 15:09:43,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 15:09:43,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-02 15:09:43,671 INFO L87 Difference]: Start difference. First operand 3558 states and 5350 transitions. Second operand 13 states. [2019-10-02 15:09:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:48,216 INFO L93 Difference]: Finished difference Result 18347 states and 28459 transitions. [2019-10-02 15:09:48,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 15:09:48,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2019-10-02 15:09:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:48,293 INFO L225 Difference]: With dead ends: 18347 [2019-10-02 15:09:48,293 INFO L226 Difference]: Without dead ends: 15008 [2019-10-02 15:09:48,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 15:09:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15008 states. [2019-10-02 15:09:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15008 to 9082. [2019-10-02 15:09:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9082 states. [2019-10-02 15:09:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9082 states to 9082 states and 13835 transitions. [2019-10-02 15:09:49,013 INFO L78 Accepts]: Start accepts. Automaton has 9082 states and 13835 transitions. Word has length 157 [2019-10-02 15:09:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:49,014 INFO L475 AbstractCegarLoop]: Abstraction has 9082 states and 13835 transitions. [2019-10-02 15:09:49,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 15:09:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 9082 states and 13835 transitions. [2019-10-02 15:09:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 15:09:49,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:49,022 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] [2019-10-02 15:09:49,023 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash -253521854, now seen corresponding path program 1 times [2019-10-02 15:09:49,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:49,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:49,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:49,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:49,295 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:49,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:49,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:09:49,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:09:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:09:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:09:49,298 INFO L87 Difference]: Start difference. First operand 9082 states and 13835 transitions. Second operand 9 states. [2019-10-02 15:09:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:50,301 INFO L93 Difference]: Finished difference Result 12850 states and 19769 transitions. [2019-10-02 15:09:50,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:09:50,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-10-02 15:09:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:50,313 INFO L225 Difference]: With dead ends: 12850 [2019-10-02 15:09:50,313 INFO L226 Difference]: Without dead ends: 4668 [2019-10-02 15:09:50,330 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:09:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-10-02 15:09:50,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 3558. [2019-10-02 15:09:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2019-10-02 15:09:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5335 transitions. [2019-10-02 15:09:50,592 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5335 transitions. Word has length 157 [2019-10-02 15:09:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:50,592 INFO L475 AbstractCegarLoop]: Abstraction has 3558 states and 5335 transitions. [2019-10-02 15:09:50,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:09:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5335 transitions. [2019-10-02 15:09:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 15:09:50,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:50,597 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] [2019-10-02 15:09:50,597 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:50,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:50,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1981028429, now seen corresponding path program 1 times [2019-10-02 15:09:50,598 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:50,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:50,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:50,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:09:50,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:50,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:09:50,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:09:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:09:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:09:50,825 INFO L87 Difference]: Start difference. First operand 3558 states and 5335 transitions. Second operand 9 states. [2019-10-02 15:09:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:52,781 INFO L93 Difference]: Finished difference Result 16721 states and 25805 transitions. [2019-10-02 15:09:52,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 15:09:52,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-10-02 15:09:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:52,816 INFO L225 Difference]: With dead ends: 16721 [2019-10-02 15:09:52,816 INFO L226 Difference]: Without dead ends: 13382 [2019-10-02 15:09:52,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:09:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-10-02 15:09:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 8886. [2019-10-02 15:09:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8886 states. [2019-10-02 15:09:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 13413 transitions. [2019-10-02 15:09:53,385 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 13413 transitions. Word has length 157 [2019-10-02 15:09:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:53,385 INFO L475 AbstractCegarLoop]: Abstraction has 8886 states and 13413 transitions. [2019-10-02 15:09:53,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:09:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 13413 transitions. [2019-10-02 15:09:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 15:09:53,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:53,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] [2019-10-02 15:09:53,394 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:53,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2002866937, now seen corresponding path program 1 times [2019-10-02 15:09:53,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:53,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:53,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:53,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:53,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:09:53,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:53,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:53,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:53,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:53,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:53,598 INFO L87 Difference]: Start difference. First operand 8886 states and 13413 transitions. Second operand 4 states. [2019-10-02 15:09:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:54,095 INFO L93 Difference]: Finished difference Result 16603 states and 25814 transitions. [2019-10-02 15:09:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:54,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-02 15:09:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:54,119 INFO L225 Difference]: With dead ends: 16603 [2019-10-02 15:09:54,119 INFO L226 Difference]: Without dead ends: 10662 [2019-10-02 15:09:54,132 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:09:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2019-10-02 15:09:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 10660. [2019-10-02 15:09:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10660 states. [2019-10-02 15:09:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10660 states to 10660 states and 16201 transitions. [2019-10-02 15:09:54,990 INFO L78 Accepts]: Start accepts. Automaton has 10660 states and 16201 transitions. Word has length 157 [2019-10-02 15:09:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:54,991 INFO L475 AbstractCegarLoop]: Abstraction has 10660 states and 16201 transitions. [2019-10-02 15:09:54,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 10660 states and 16201 transitions. [2019-10-02 15:09:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 15:09:55,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:55,001 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] [2019-10-02 15:09:55,002 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:55,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:55,002 INFO L82 PathProgramCache]: Analyzing trace with hash -286073469, now seen corresponding path program 1 times [2019-10-02 15:09:55,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:55,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:55,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:55,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:55,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:55,188 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:55,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:55,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:09:55,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:09:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:09:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:09:55,190 INFO L87 Difference]: Start difference. First operand 10660 states and 16201 transitions. Second operand 4 states. [2019-10-02 15:09:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:56,075 INFO L93 Difference]: Finished difference Result 28048 states and 42570 transitions. [2019-10-02 15:09:56,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:56,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-02 15:09:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:56,125 INFO L225 Difference]: With dead ends: 28048 [2019-10-02 15:09:56,125 INFO L226 Difference]: Without dead ends: 17411 [2019-10-02 15:09:56,146 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:09:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17411 states. [2019-10-02 15:09:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17411 to 17377. [2019-10-02 15:09:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2019-10-02 15:09:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 26114 transitions. [2019-10-02 15:09:57,163 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 26114 transitions. Word has length 157 [2019-10-02 15:09:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:57,164 INFO L475 AbstractCegarLoop]: Abstraction has 17377 states and 26114 transitions. [2019-10-02 15:09:57,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 26114 transitions. [2019-10-02 15:09:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 15:09:57,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:57,174 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:09:57,174 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1553675807, now seen corresponding path program 1 times [2019-10-02 15:09:57,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:57,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:57,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:57,358 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:57,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:57,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:57,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:57,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:57,360 INFO L87 Difference]: Start difference. First operand 17377 states and 26114 transitions. Second operand 3 states. [2019-10-02 15:09:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:59,106 INFO L93 Difference]: Finished difference Result 46780 states and 70277 transitions. [2019-10-02 15:09:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:09:59,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 15:09:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:59,153 INFO L225 Difference]: With dead ends: 46780 [2019-10-02 15:09:59,153 INFO L226 Difference]: Without dead ends: 29799 [2019-10-02 15:09:59,186 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:09:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29799 states. [2019-10-02 15:10:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29799 to 29769. [2019-10-02 15:10:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29769 states. [2019-10-02 15:10:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29769 states to 29769 states and 44199 transitions. [2019-10-02 15:10:00,784 INFO L78 Accepts]: Start accepts. Automaton has 29769 states and 44199 transitions. Word has length 159 [2019-10-02 15:10:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:00,784 INFO L475 AbstractCegarLoop]: Abstraction has 29769 states and 44199 transitions. [2019-10-02 15:10:00,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:10:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 29769 states and 44199 transitions. [2019-10-02 15:10:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 15:10:00,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:00,798 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:10:00,799 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2132469410, now seen corresponding path program 1 times [2019-10-02 15:10:00,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:00,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:00,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:00,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:00,932 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:00,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:00,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:10:00,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:10:00,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:10:00,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:10:00,934 INFO L87 Difference]: Start difference. First operand 29769 states and 44199 transitions. Second operand 4 states. [2019-10-02 15:10:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:02,362 INFO L93 Difference]: Finished difference Result 50148 states and 74433 transitions. [2019-10-02 15:10:02,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:10:02,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-02 15:10:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:02,395 INFO L225 Difference]: With dead ends: 50148 [2019-10-02 15:10:02,395 INFO L226 Difference]: Without dead ends: 27144 [2019-10-02 15:10:02,417 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:10:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27144 states. [2019-10-02 15:10:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27144 to 27144. [2019-10-02 15:10:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27144 states. [2019-10-02 15:10:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27144 states to 27144 states and 40307 transitions. [2019-10-02 15:10:04,676 INFO L78 Accepts]: Start accepts. Automaton has 27144 states and 40307 transitions. Word has length 159 [2019-10-02 15:10:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:04,676 INFO L475 AbstractCegarLoop]: Abstraction has 27144 states and 40307 transitions. [2019-10-02 15:10:04,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:10:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 27144 states and 40307 transitions. [2019-10-02 15:10:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 15:10:04,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:04,684 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] [2019-10-02 15:10:04,684 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:04,685 INFO L82 PathProgramCache]: Analyzing trace with hash 642084846, now seen corresponding path program 1 times [2019-10-02 15:10:04,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:04,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:04,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:04,764 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:04,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:04,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:10:04,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:10:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:10:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:10:04,766 INFO L87 Difference]: Start difference. First operand 27144 states and 40307 transitions. Second operand 3 states. [2019-10-02 15:10:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:06,995 INFO L93 Difference]: Finished difference Result 72226 states and 108579 transitions. [2019-10-02 15:10:06,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:10:06,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-02 15:10:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:07,078 INFO L225 Difference]: With dead ends: 72226 [2019-10-02 15:10:07,078 INFO L226 Difference]: Without dead ends: 45418 [2019-10-02 15:10:07,118 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:10:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45418 states. [2019-10-02 15:10:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45418 to 41012. [2019-10-02 15:10:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41012 states. [2019-10-02 15:10:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41012 states to 41012 states and 62306 transitions. [2019-10-02 15:10:10,141 INFO L78 Accepts]: Start accepts. Automaton has 41012 states and 62306 transitions. Word has length 163 [2019-10-02 15:10:10,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:10,142 INFO L475 AbstractCegarLoop]: Abstraction has 41012 states and 62306 transitions. [2019-10-02 15:10:10,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:10:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 41012 states and 62306 transitions. [2019-10-02 15:10:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 15:10:10,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:10,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,154 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:10,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1347636143, now seen corresponding path program 1 times [2019-10-02 15:10:10,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:10,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:10,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:10,339 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:10,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:10,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:10:10,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:10:10,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:10:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:10:10,341 INFO L87 Difference]: Start difference. First operand 41012 states and 62306 transitions. Second operand 4 states. [2019-10-02 15:10:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:15,033 INFO L93 Difference]: Finished difference Result 115881 states and 175779 transitions. [2019-10-02 15:10:15,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:10:15,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-02 15:10:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:15,138 INFO L225 Difference]: With dead ends: 115881 [2019-10-02 15:10:15,138 INFO L226 Difference]: Without dead ends: 74912 [2019-10-02 15:10:15,191 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:10:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74912 states. [2019-10-02 15:10:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74912 to 74854. [2019-10-02 15:10:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74854 states. [2019-10-02 15:10:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74854 states to 74854 states and 112645 transitions. [2019-10-02 15:10:20,955 INFO L78 Accepts]: Start accepts. Automaton has 74854 states and 112645 transitions. Word has length 163 [2019-10-02 15:10:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:20,956 INFO L475 AbstractCegarLoop]: Abstraction has 74854 states and 112645 transitions. [2019-10-02 15:10:20,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:10:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 74854 states and 112645 transitions. [2019-10-02 15:10:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 15:10:20,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:20,972 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] [2019-10-02 15:10:20,972 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -603572205, now seen corresponding path program 1 times [2019-10-02 15:10:20,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:20,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:20,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:20,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:20,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:21,029 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:21,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:21,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:10:21,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:10:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:10:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:10:21,031 INFO L87 Difference]: Start difference. First operand 74854 states and 112645 transitions. Second operand 3 states. [2019-10-02 15:10:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:30,950 INFO L93 Difference]: Finished difference Result 224362 states and 337680 transitions. [2019-10-02 15:10:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:10:30,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-02 15:10:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:31,154 INFO L225 Difference]: With dead ends: 224362 [2019-10-02 15:10:31,155 INFO L226 Difference]: Without dead ends: 149617 [2019-10-02 15:10:31,217 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:10:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149617 states. [2019-10-02 15:10:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149617 to 74860. [2019-10-02 15:10:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74860 states. [2019-10-02 15:10:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74860 states to 74860 states and 112651 transitions. [2019-10-02 15:10:36,083 INFO L78 Accepts]: Start accepts. Automaton has 74860 states and 112651 transitions. Word has length 164 [2019-10-02 15:10:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:36,084 INFO L475 AbstractCegarLoop]: Abstraction has 74860 states and 112651 transitions. [2019-10-02 15:10:36,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:10:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 74860 states and 112651 transitions. [2019-10-02 15:10:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 15:10:36,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:36,099 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:10:36,099 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash -115889413, now seen corresponding path program 1 times [2019-10-02 15:10:36,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:36,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:36,203 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:36,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:36,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:10:36,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:10:36,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:10:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:10:36,205 INFO L87 Difference]: Start difference. First operand 74860 states and 112651 transitions. Second operand 3 states. [2019-10-02 15:10:45,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:45,150 INFO L93 Difference]: Finished difference Result 199304 states and 299050 transitions. [2019-10-02 15:10:45,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:10:45,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 15:10:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:45,347 INFO L225 Difference]: With dead ends: 199304 [2019-10-02 15:10:45,348 INFO L226 Difference]: Without dead ends: 125194 [2019-10-02 15:10:45,416 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:10:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125194 states. [2019-10-02 15:10:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125194 to 125136. [2019-10-02 15:10:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125136 states. [2019-10-02 15:10:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125136 states to 125136 states and 185628 transitions. [2019-10-02 15:10:55,822 INFO L78 Accepts]: Start accepts. Automaton has 125136 states and 185628 transitions. Word has length 165 [2019-10-02 15:10:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:55,822 INFO L475 AbstractCegarLoop]: Abstraction has 125136 states and 185628 transitions. [2019-10-02 15:10:55,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:10:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 125136 states and 185628 transitions. [2019-10-02 15:10:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 15:10:55,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:55,841 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:10:55,841 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:55,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2071290366, now seen corresponding path program 1 times [2019-10-02 15:10:55,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:55,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:55,964 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:55,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:55,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:10:55,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:10:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:10:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:10:55,966 INFO L87 Difference]: Start difference. First operand 125136 states and 185628 transitions. Second operand 4 states. [2019-10-02 15:11:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:03,408 INFO L93 Difference]: Finished difference Result 237191 states and 352256 transitions. [2019-10-02 15:11:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:11:03,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-02 15:11:03,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:03,566 INFO L225 Difference]: With dead ends: 237191 [2019-10-02 15:11:03,566 INFO L226 Difference]: Without dead ends: 112729 [2019-10-02 15:11:03,645 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:11:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112729 states. [2019-10-02 15:11:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112729 to 112729. [2019-10-02 15:11:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112729 states. [2019-10-02 15:11:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112729 states to 112729 states and 167393 transitions. [2019-10-02 15:11:14,734 INFO L78 Accepts]: Start accepts. Automaton has 112729 states and 167393 transitions. Word has length 165 [2019-10-02 15:11:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:14,734 INFO L475 AbstractCegarLoop]: Abstraction has 112729 states and 167393 transitions. [2019-10-02 15:11:14,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:11:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 112729 states and 167393 transitions. [2019-10-02 15:11:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 15:11:14,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:14,754 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] [2019-10-02 15:11:14,754 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1478414802, now seen corresponding path program 1 times [2019-10-02 15:11:14,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:14,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:14,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:14,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:14,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:11:14,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:14,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:11:14,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:11:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:11:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:11:14,847 INFO L87 Difference]: Start difference. First operand 112729 states and 167393 transitions. Second operand 3 states. [2019-10-02 15:11:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:27,024 INFO L93 Difference]: Finished difference Result 287648 states and 430049 transitions. [2019-10-02 15:11:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:11:27,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 15:11:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:27,328 INFO L225 Difference]: With dead ends: 287648 [2019-10-02 15:11:27,328 INFO L226 Difference]: Without dead ends: 189855 [2019-10-02 15:11:27,428 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:11:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189855 states. [2019-10-02 15:11:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189855 to 175437. [2019-10-02 15:11:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175437 states. [2019-10-02 15:11:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175437 states to 175437 states and 263484 transitions. [2019-10-02 15:11:43,489 INFO L78 Accepts]: Start accepts. Automaton has 175437 states and 263484 transitions. Word has length 169 [2019-10-02 15:11:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:43,490 INFO L475 AbstractCegarLoop]: Abstraction has 175437 states and 263484 transitions. [2019-10-02 15:11:43,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:11:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 175437 states and 263484 transitions. [2019-10-02 15:11:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:11:43,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:43,512 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] [2019-10-02 15:11:43,512 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 525237271, now seen corresponding path program 1 times [2019-10-02 15:11:43,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:43,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:43,678 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:43,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:43,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:11:43,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:11:43,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:11:43,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:11:43,680 INFO L87 Difference]: Start difference. First operand 175437 states and 263484 transitions. Second operand 8 states. [2019-10-02 15:12:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:12:25,093 INFO L93 Difference]: Finished difference Result 638331 states and 957270 transitions. [2019-10-02 15:12:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:12:25,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-10-02 15:12:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:12:25,947 INFO L225 Difference]: With dead ends: 638331 [2019-10-02 15:12:25,947 INFO L226 Difference]: Without dead ends: 477097 [2019-10-02 15:12:26,144 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:12:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477097 states. [2019-10-02 15:12:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477097 to 208605. [2019-10-02 15:12:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208605 states. [2019-10-02 15:12:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208605 states to 208605 states and 313124 transitions. [2019-10-02 15:12:51,764 INFO L78 Accepts]: Start accepts. Automaton has 208605 states and 313124 transitions. Word has length 170 [2019-10-02 15:12:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:12:51,764 INFO L475 AbstractCegarLoop]: Abstraction has 208605 states and 313124 transitions. [2019-10-02 15:12:51,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:12:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 208605 states and 313124 transitions. [2019-10-02 15:12:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:12:51,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:12:51,783 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] [2019-10-02 15:12:51,783 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:12:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:12:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1869056238, now seen corresponding path program 1 times [2019-10-02 15:12:51,784 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:12:51,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:12:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:51,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:51,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:51,905 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:51,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:12:51,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:12:51,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:12:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:12:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:12:51,907 INFO L87 Difference]: Start difference. First operand 208605 states and 313124 transitions. Second operand 4 states. [2019-10-02 15:13:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:13:16,705 INFO L93 Difference]: Finished difference Result 354755 states and 534890 transitions. [2019-10-02 15:13:16,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:13:16,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-02 15:13:16,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:13:17,236 INFO L225 Difference]: With dead ends: 354755 [2019-10-02 15:13:17,236 INFO L226 Difference]: Without dead ends: 280414 [2019-10-02 15:13:17,347 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:13:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280414 states. [2019-10-02 15:13:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280414 to 206617. [2019-10-02 15:13:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206617 states. [2019-10-02 15:13:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206617 states to 206617 states and 310664 transitions. [2019-10-02 15:13:41,380 INFO L78 Accepts]: Start accepts. Automaton has 206617 states and 310664 transitions. Word has length 170 [2019-10-02 15:13:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:13:41,380 INFO L475 AbstractCegarLoop]: Abstraction has 206617 states and 310664 transitions. [2019-10-02 15:13:41,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:13:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 206617 states and 310664 transitions. [2019-10-02 15:13:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:13:41,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:13:41,396 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] [2019-10-02 15:13:41,396 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:13:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:13:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash -831791091, now seen corresponding path program 1 times [2019-10-02 15:13:41,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:13:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:13:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:41,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:13:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:13:41,605 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:41,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:13:41,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:13:41,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:13:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:13:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:13:41,607 INFO L87 Difference]: Start difference. First operand 206617 states and 310664 transitions. Second operand 8 states. [2019-10-02 15:14:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:14:38,842 INFO L93 Difference]: Finished difference Result 650240 states and 968605 transitions. [2019-10-02 15:14:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:14:38,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-10-02 15:14:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:14:39,886 INFO L225 Difference]: With dead ends: 650240 [2019-10-02 15:14:39,886 INFO L226 Difference]: Without dead ends: 579591 [2019-10-02 15:14:40,040 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:14:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579591 states. [2019-10-02 15:15:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579591 to 167465. [2019-10-02 15:15:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167465 states. [2019-10-02 15:15:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167465 states to 167465 states and 249100 transitions. [2019-10-02 15:15:07,071 INFO L78 Accepts]: Start accepts. Automaton has 167465 states and 249100 transitions. Word has length 170 [2019-10-02 15:15:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:15:07,071 INFO L475 AbstractCegarLoop]: Abstraction has 167465 states and 249100 transitions. [2019-10-02 15:15:07,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:15:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 167465 states and 249100 transitions. [2019-10-02 15:15:07,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:15:07,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:15:07,085 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] [2019-10-02 15:15:07,085 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:15:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:15:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash -833569283, now seen corresponding path program 1 times [2019-10-02 15:15:07,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:15:07,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:15:07,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:07,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:15:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:15:07,261 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:07,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:15:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:15:07,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:15:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:15:07,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:15:07,262 INFO L87 Difference]: Start difference. First operand 167465 states and 249100 transitions. Second operand 8 states. [2019-10-02 15:16:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:16:06,629 INFO L93 Difference]: Finished difference Result 623855 states and 924833 transitions. [2019-10-02 15:16:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:16:06,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-10-02 15:16:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:16:07,513 INFO L225 Difference]: With dead ends: 623855 [2019-10-02 15:16:07,513 INFO L226 Difference]: Without dead ends: 463421 [2019-10-02 15:16:07,692 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:16:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463421 states. [2019-10-02 15:16:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463421 to 250105. [2019-10-02 15:16:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250105 states. [2019-10-02 15:16:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250105 states to 250105 states and 366523 transitions. [2019-10-02 15:16:45,130 INFO L78 Accepts]: Start accepts. Automaton has 250105 states and 366523 transitions. Word has length 170 [2019-10-02 15:16:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:16:45,131 INFO L475 AbstractCegarLoop]: Abstraction has 250105 states and 366523 transitions. [2019-10-02 15:16:45,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:16:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 250105 states and 366523 transitions. [2019-10-02 15:16:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:16:45,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:16:45,146 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] [2019-10-02 15:16:45,146 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:16:45,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:16:45,147 INFO L82 PathProgramCache]: Analyzing trace with hash -650317869, now seen corresponding path program 1 times [2019-10-02 15:16:45,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:16:45,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:16:45,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:16:45,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:16:45,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:16:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:16:45,352 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:16:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:16:45,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:16:45,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:16:45,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:16:45,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:16:45,355 INFO L87 Difference]: Start difference. First operand 250105 states and 366523 transitions. Second operand 4 states. [2019-10-02 15:17:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:17:19,898 INFO L93 Difference]: Finished difference Result 482683 states and 707336 transitions. [2019-10-02 15:17:19,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:17:19,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-02 15:17:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:17:20,310 INFO L225 Difference]: With dead ends: 482683 [2019-10-02 15:17:20,310 INFO L226 Difference]: Without dead ends: 232891 [2019-10-02 15:17:20,461 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:17:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232891 states. [2019-10-02 15:17:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232891 to 232821. [2019-10-02 15:17:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232821 states. [2019-10-02 15:17:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232821 states to 232821 states and 341089 transitions. [2019-10-02 15:17:48,393 INFO L78 Accepts]: Start accepts. Automaton has 232821 states and 341089 transitions. Word has length 170 [2019-10-02 15:17:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:17:48,393 INFO L475 AbstractCegarLoop]: Abstraction has 232821 states and 341089 transitions. [2019-10-02 15:17:48,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:17:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 232821 states and 341089 transitions. [2019-10-02 15:17:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 15:17:48,412 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:17:48,412 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] [2019-10-02 15:17:48,412 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:17:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:17:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash -260368357, now seen corresponding path program 1 times [2019-10-02 15:17:48,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:17:48,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:17:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:17:48,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:17:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:17:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:17:48,581 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:17:48,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:17:48,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:17:48,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:17:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:17:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:17:48,582 INFO L87 Difference]: Start difference. First operand 232821 states and 341089 transitions. Second operand 4 states. [2019-10-02 15:18:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:18:22,459 INFO L93 Difference]: Finished difference Result 465703 states and 682233 transitions. [2019-10-02 15:18:22,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:18:22,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-02 15:18:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:18:22,872 INFO L225 Difference]: With dead ends: 465703 [2019-10-02 15:18:22,872 INFO L226 Difference]: Without dead ends: 233041 [2019-10-02 15:18:23,041 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:18:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233041 states. [2019-10-02 15:18:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233041 to 232923. [2019-10-02 15:18:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232923 states. [2019-10-02 15:18:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232923 states to 232923 states and 341189 transitions. [2019-10-02 15:18:51,223 INFO L78 Accepts]: Start accepts. Automaton has 232923 states and 341189 transitions. Word has length 172 [2019-10-02 15:18:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:18:51,224 INFO L475 AbstractCegarLoop]: Abstraction has 232923 states and 341189 transitions. [2019-10-02 15:18:51,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:18:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 232923 states and 341189 transitions. [2019-10-02 15:18:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 15:18:51,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:18:51,241 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:18:51,241 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:18:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:18:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -686513461, now seen corresponding path program 1 times [2019-10-02 15:18:51,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:18:51,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:18:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:18:51,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:18:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:18:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:18:51,302 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:18:51,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:18:51,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:18:51,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:18:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:18:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:18:51,303 INFO L87 Difference]: Start difference. First operand 232923 states and 341189 transitions. Second operand 3 states. [2019-10-02 15:19:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:19:52,420 INFO L93 Difference]: Finished difference Result 650579 states and 953002 transitions. [2019-10-02 15:19:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:19:52,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-10-02 15:19:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:19:53,280 INFO L225 Difference]: With dead ends: 650579 [2019-10-02 15:19:53,280 INFO L226 Difference]: Without dead ends: 465635 [2019-10-02 15:19:53,453 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:19:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465635 states. [2019-10-02 15:20:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465635 to 232933. [2019-10-02 15:20:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232933 states. [2019-10-02 15:20:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232933 states to 232933 states and 341199 transitions. [2019-10-02 15:20:32,537 INFO L78 Accepts]: Start accepts. Automaton has 232933 states and 341199 transitions. Word has length 173 [2019-10-02 15:20:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:20:32,537 INFO L475 AbstractCegarLoop]: Abstraction has 232933 states and 341199 transitions. [2019-10-02 15:20:32,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:20:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 232933 states and 341199 transitions. [2019-10-02 15:20:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 15:20:32,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:20:32,550 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] [2019-10-02 15:20:32,551 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:20:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:20:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1907638940, now seen corresponding path program 1 times [2019-10-02 15:20:32,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:20:32,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:20:32,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:20:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:20:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:20:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:20:32,669 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:20:32,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:20:32,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:20:32,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:20:32,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:20:32,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:20:32,671 INFO L87 Difference]: Start difference. First operand 232933 states and 341199 transitions. Second operand 4 states. [2019-10-02 15:21:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:21:01,900 INFO L93 Difference]: Finished difference Result 418312 states and 612537 transitions. [2019-10-02 15:21:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:21:01,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-10-02 15:21:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:21:02,282 INFO L225 Difference]: With dead ends: 418312 [2019-10-02 15:21:02,282 INFO L226 Difference]: Without dead ends: 232923 [2019-10-02 15:21:02,407 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:21:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232923 states.