java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:04:24,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:04:24,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:04:24,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:04:24,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:04:24,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:04:24,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:04:24,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:04:24,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:04:24,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:04:24,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:04:24,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:04:24,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:04:24,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:04:24,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:04:24,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:04:24,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:04:24,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:04:24,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:04:24,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:04:24,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:04:24,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:04:24,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:04:24,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:04:24,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:04:24,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:04:24,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:04:24,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:04:24,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:04:24,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:04:24,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:04:24,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:04:24,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:04:24,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:04:24,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:04:24,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:04:24,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:04:24,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:04:24,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:04:24,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:04:24,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:04:24,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:04:24,347 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:04:24,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:04:24,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:04:24,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:04:24,349 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:04:24,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:04:24,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:04:24,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:04:24,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:04:24,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:04:24,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:04:24,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:04:24,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:04:24,352 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:04:24,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:04:24,352 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:04:24,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:04:24,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:04:24,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:04:24,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:04:24,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:04:24,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:04:24,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:04:24,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:04:24,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:04:24,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:04:24,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:04:24,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:04:24,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:04:24,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:04:24,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:04:24,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:04:24,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:04:24,411 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:04:24,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:04:24,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6680853b/76f0f6dab1994d0abed735b8abd882dd/FLAG1e50dbe77 [2019-09-08 12:04:25,180 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:04:25,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:04:25,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6680853b/76f0f6dab1994d0abed735b8abd882dd/FLAG1e50dbe77 [2019-09-08 12:04:25,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6680853b/76f0f6dab1994d0abed735b8abd882dd [2019-09-08 12:04:25,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:04:25,335 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:04:25,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:04:25,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:04:25,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:04:25,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:04:25" (1/1) ... [2019-09-08 12:04:25,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f0e126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:25, skipping insertion in model container [2019-09-08 12:04:25,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:04:25" (1/1) ... [2019-09-08 12:04:25,353 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:04:25,502 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:04:26,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:04:26,588 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:04:27,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:04:27,048 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:04:27,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27 WrapperNode [2019-09-08 12:04:27,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:04:27,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:04:27,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:04:27,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:04:27,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... [2019-09-08 12:04:27,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... [2019-09-08 12:04:27,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... [2019-09-08 12:04:27,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... [2019-09-08 12:04:27,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... [2019-09-08 12:04:27,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... [2019-09-08 12:04:27,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... [2019-09-08 12:04:27,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:04:27,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:04:27,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:04:27,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:04:27,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:04:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:04:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:04:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:04:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:04:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:04:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:04:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:04:27,349 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:04:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:04:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:04:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:04:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:04:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:04:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:04:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:04:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:04:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:04:27,352 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:04:27,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:04:27,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:04:27,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:04:30,626 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:04:30,626 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:04:30,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:04:30 BoogieIcfgContainer [2019-09-08 12:04:30,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:04:30,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:04:30,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:04:30,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:04:30,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:04:25" (1/3) ... [2019-09-08 12:04:30,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb41fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:04:30, skipping insertion in model container [2019-09-08 12:04:30,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:04:27" (2/3) ... [2019-09-08 12:04:30,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb41fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:04:30, skipping insertion in model container [2019-09-08 12:04:30,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:04:30" (3/3) ... [2019-09-08 12:04:30,643 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:04:30,654 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:04:30,684 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 12:04:30,705 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 12:04:30,763 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:04:30,765 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:04:30,765 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:04:30,765 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:04:30,766 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:04:30,766 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:04:30,766 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:04:30,766 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:04:30,766 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:04:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states. [2019-09-08 12:04:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:04:30,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:30,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:30,855 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:30,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2026715041, now seen corresponding path program 1 times [2019-09-08 12:04:30,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:30,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:30,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:31,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:31,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:31,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:31,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:31,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:31,479 INFO L87 Difference]: Start difference. First operand 1116 states. Second operand 5 states. [2019-09-08 12:04:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:32,627 INFO L93 Difference]: Finished difference Result 1265 states and 2224 transitions. [2019-09-08 12:04:32,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:32,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:04:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:32,662 INFO L225 Difference]: With dead ends: 1265 [2019-09-08 12:04:32,663 INFO L226 Difference]: Without dead ends: 704 [2019-09-08 12:04:32,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-08 12:04:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-09-08 12:04:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-08 12:04:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 889 transitions. [2019-09-08 12:04:32,829 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 889 transitions. Word has length 76 [2019-09-08 12:04:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:32,830 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 889 transitions. [2019-09-08 12:04:32,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 889 transitions. [2019-09-08 12:04:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:04:32,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:32,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:32,839 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:32,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1438864747, now seen corresponding path program 1 times [2019-09-08 12:04:32,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:32,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:32,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:32,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:33,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:33,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:33,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:33,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:33,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:33,092 INFO L87 Difference]: Start difference. First operand 704 states and 889 transitions. Second operand 5 states. [2019-09-08 12:04:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:33,595 INFO L93 Difference]: Finished difference Result 913 states and 1162 transitions. [2019-09-08 12:04:33,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:33,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:04:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:33,600 INFO L225 Difference]: With dead ends: 913 [2019-09-08 12:04:33,600 INFO L226 Difference]: Without dead ends: 546 [2019-09-08 12:04:33,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-08 12:04:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-09-08 12:04:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-08 12:04:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 698 transitions. [2019-09-08 12:04:33,624 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 698 transitions. Word has length 76 [2019-09-08 12:04:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:33,625 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 698 transitions. [2019-09-08 12:04:33,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 698 transitions. [2019-09-08 12:04:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:04:33,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:33,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:33,628 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1708480706, now seen corresponding path program 1 times [2019-09-08 12:04:33,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:33,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:33,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:33,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:33,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:33,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:33,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:33,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:33,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:33,763 INFO L87 Difference]: Start difference. First operand 546 states and 698 transitions. Second operand 5 states. [2019-09-08 12:04:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:34,455 INFO L93 Difference]: Finished difference Result 1016 states and 1327 transitions. [2019-09-08 12:04:34,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:34,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 12:04:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:34,463 INFO L225 Difference]: With dead ends: 1016 [2019-09-08 12:04:34,464 INFO L226 Difference]: Without dead ends: 721 [2019-09-08 12:04:34,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-08 12:04:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 657. [2019-09-08 12:04:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 12:04:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 887 transitions. [2019-09-08 12:04:34,512 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 887 transitions. Word has length 76 [2019-09-08 12:04:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:34,513 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 887 transitions. [2019-09-08 12:04:34,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 887 transitions. [2019-09-08 12:04:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:04:34,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:34,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:34,516 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash 755366932, now seen corresponding path program 1 times [2019-09-08 12:04:34,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:34,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:34,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:34,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:34,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:34,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:34,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:34,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:34,627 INFO L87 Difference]: Start difference. First operand 657 states and 887 transitions. Second operand 5 states. [2019-09-08 12:04:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:35,111 INFO L93 Difference]: Finished difference Result 958 states and 1303 transitions. [2019-09-08 12:04:35,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:35,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:04:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:35,116 INFO L225 Difference]: With dead ends: 958 [2019-09-08 12:04:35,116 INFO L226 Difference]: Without dead ends: 641 [2019-09-08 12:04:35,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-08 12:04:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-08 12:04:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 12:04:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 867 transitions. [2019-09-08 12:04:35,161 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 867 transitions. Word has length 77 [2019-09-08 12:04:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:35,162 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 867 transitions. [2019-09-08 12:04:35,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 867 transitions. [2019-09-08 12:04:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:04:35,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:35,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:35,166 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:35,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1886479960, now seen corresponding path program 1 times [2019-09-08 12:04:35,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:35,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:35,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:35,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:35,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:35,319 INFO L87 Difference]: Start difference. First operand 641 states and 867 transitions. Second operand 5 states. [2019-09-08 12:04:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:35,727 INFO L93 Difference]: Finished difference Result 905 states and 1224 transitions. [2019-09-08 12:04:35,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:35,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 12:04:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:35,732 INFO L225 Difference]: With dead ends: 905 [2019-09-08 12:04:35,732 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 12:04:35,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 12:04:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2019-09-08 12:04:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 740 transitions. [2019-09-08 12:04:35,812 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 740 transitions. Word has length 78 [2019-09-08 12:04:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:35,813 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 740 transitions. [2019-09-08 12:04:35,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 740 transitions. [2019-09-08 12:04:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:04:35,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:35,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:35,815 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:35,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash -213392593, now seen corresponding path program 1 times [2019-09-08 12:04:35,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:35,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:36,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:36,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:04:36,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:04:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:04:36,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:04:36,022 INFO L87 Difference]: Start difference. First operand 547 states and 740 transitions. Second operand 8 states. [2019-09-08 12:04:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:36,969 INFO L93 Difference]: Finished difference Result 1049 states and 1402 transitions. [2019-09-08 12:04:36,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:04:36,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-08 12:04:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:36,974 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 12:04:36,975 INFO L226 Difference]: Without dead ends: 775 [2019-09-08 12:04:36,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:04:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-08 12:04:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 547. [2019-09-08 12:04:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 739 transitions. [2019-09-08 12:04:37,016 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 739 transitions. Word has length 79 [2019-09-08 12:04:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:37,016 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 739 transitions. [2019-09-08 12:04:37,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:04:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 739 transitions. [2019-09-08 12:04:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:04:37,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:37,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:37,019 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash -929977429, now seen corresponding path program 1 times [2019-09-08 12:04:37,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:37,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:37,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:37,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:37,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:37,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:37,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:37,196 INFO L87 Difference]: Start difference. First operand 547 states and 739 transitions. Second operand 9 states. [2019-09-08 12:04:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:38,556 INFO L93 Difference]: Finished difference Result 1244 states and 1739 transitions. [2019-09-08 12:04:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:38,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 12:04:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:38,563 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 12:04:38,563 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:38,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 738 transitions. [2019-09-08 12:04:38,608 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 738 transitions. Word has length 79 [2019-09-08 12:04:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:38,609 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 738 transitions. [2019-09-08 12:04:38,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 738 transitions. [2019-09-08 12:04:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:04:38,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:38,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:38,612 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash -868457063, now seen corresponding path program 1 times [2019-09-08 12:04:38,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:38,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:38,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:38,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:38,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:38,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:38,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:38,803 INFO L87 Difference]: Start difference. First operand 547 states and 738 transitions. Second operand 9 states. [2019-09-08 12:04:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:40,444 INFO L93 Difference]: Finished difference Result 1064 states and 1498 transitions. [2019-09-08 12:04:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:04:40,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 12:04:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:40,449 INFO L225 Difference]: With dead ends: 1064 [2019-09-08 12:04:40,449 INFO L226 Difference]: Without dead ends: 874 [2019-09-08 12:04:40,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:04:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-08 12:04:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2019-09-08 12:04:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 737 transitions. [2019-09-08 12:04:40,491 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 737 transitions. Word has length 79 [2019-09-08 12:04:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:40,491 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 737 transitions. [2019-09-08 12:04:40,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 737 transitions. [2019-09-08 12:04:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:40,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:40,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:40,494 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1890090262, now seen corresponding path program 1 times [2019-09-08 12:04:40,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:40,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:40,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:40,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:40,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:40,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:40,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:40,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:40,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:40,709 INFO L87 Difference]: Start difference. First operand 547 states and 737 transitions. Second operand 9 states. [2019-09-08 12:04:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:42,055 INFO L93 Difference]: Finished difference Result 1123 states and 1550 transitions. [2019-09-08 12:04:42,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:42,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:42,062 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 12:04:42,063 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:42,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 735 transitions. [2019-09-08 12:04:42,160 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 735 transitions. Word has length 81 [2019-09-08 12:04:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:42,161 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 735 transitions. [2019-09-08 12:04:42,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 735 transitions. [2019-09-08 12:04:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:42,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:42,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:42,164 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1898902830, now seen corresponding path program 1 times [2019-09-08 12:04:42,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:42,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:42,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:42,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:42,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:42,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:42,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:42,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:42,370 INFO L87 Difference]: Start difference. First operand 547 states and 735 transitions. Second operand 9 states. [2019-09-08 12:04:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:43,828 INFO L93 Difference]: Finished difference Result 1300 states and 1816 transitions. [2019-09-08 12:04:43,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:43,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:43,835 INFO L225 Difference]: With dead ends: 1300 [2019-09-08 12:04:43,835 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:43,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2019-09-08 12:04:43,882 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 81 [2019-09-08 12:04:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:43,882 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2019-09-08 12:04:43,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2019-09-08 12:04:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:43,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:43,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:43,885 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash 59601677, now seen corresponding path program 1 times [2019-09-08 12:04:43,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:43,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:43,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:43,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:44,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:44,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:44,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:44,041 INFO L87 Difference]: Start difference. First operand 547 states and 733 transitions. Second operand 9 states. [2019-09-08 12:04:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:45,326 INFO L93 Difference]: Finished difference Result 1250 states and 1739 transitions. [2019-09-08 12:04:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:45,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:45,331 INFO L225 Difference]: With dead ends: 1250 [2019-09-08 12:04:45,331 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:45,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 731 transitions. [2019-09-08 12:04:45,378 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 731 transitions. Word has length 81 [2019-09-08 12:04:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:45,379 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 731 transitions. [2019-09-08 12:04:45,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 731 transitions. [2019-09-08 12:04:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:45,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:45,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:45,381 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash 916645204, now seen corresponding path program 1 times [2019-09-08 12:04:45,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:45,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:45,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:45,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:45,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:45,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:45,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:45,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:45,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:45,538 INFO L87 Difference]: Start difference. First operand 547 states and 731 transitions. Second operand 9 states. [2019-09-08 12:04:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:46,893 INFO L93 Difference]: Finished difference Result 1130 states and 1579 transitions. [2019-09-08 12:04:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:04:46,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:46,897 INFO L225 Difference]: With dead ends: 1130 [2019-09-08 12:04:46,897 INFO L226 Difference]: Without dead ends: 874 [2019-09-08 12:04:46,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:04:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-08 12:04:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 547. [2019-09-08 12:04:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2019-09-08 12:04:46,943 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 81 [2019-09-08 12:04:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:46,944 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2019-09-08 12:04:46,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2019-09-08 12:04:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:46,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:46,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:46,946 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash -819894320, now seen corresponding path program 1 times [2019-09-08 12:04:46,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:46,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:47,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:47,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:47,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:47,137 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand 9 states. [2019-09-08 12:04:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:48,643 INFO L93 Difference]: Finished difference Result 1281 states and 1788 transitions. [2019-09-08 12:04:48,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:48,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:48,649 INFO L225 Difference]: With dead ends: 1281 [2019-09-08 12:04:48,649 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:48,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 728 transitions. [2019-09-08 12:04:48,701 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 728 transitions. Word has length 81 [2019-09-08 12:04:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:48,702 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 728 transitions. [2019-09-08 12:04:48,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 728 transitions. [2019-09-08 12:04:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:48,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:48,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:48,704 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash 494668223, now seen corresponding path program 1 times [2019-09-08 12:04:48,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:48,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:48,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:48,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:48,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:48,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:48,859 INFO L87 Difference]: Start difference. First operand 547 states and 728 transitions. Second operand 9 states. [2019-09-08 12:04:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:50,282 INFO L93 Difference]: Finished difference Result 1240 states and 1722 transitions. [2019-09-08 12:04:50,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:50,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:50,287 INFO L225 Difference]: With dead ends: 1240 [2019-09-08 12:04:50,288 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:50,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 727 transitions. [2019-09-08 12:04:50,337 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 727 transitions. Word has length 81 [2019-09-08 12:04:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:50,337 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 727 transitions. [2019-09-08 12:04:50,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 727 transitions. [2019-09-08 12:04:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:50,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:50,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:50,340 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:50,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1431462676, now seen corresponding path program 1 times [2019-09-08 12:04:50,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:50,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:50,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:50,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:50,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:50,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:50,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:50,480 INFO L87 Difference]: Start difference. First operand 547 states and 727 transitions. Second operand 9 states. [2019-09-08 12:04:51,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:51,971 INFO L93 Difference]: Finished difference Result 1290 states and 1796 transitions. [2019-09-08 12:04:51,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:51,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:51,977 INFO L225 Difference]: With dead ends: 1290 [2019-09-08 12:04:51,977 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:51,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 726 transitions. [2019-09-08 12:04:52,030 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 726 transitions. Word has length 81 [2019-09-08 12:04:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:52,030 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 726 transitions. [2019-09-08 12:04:52,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 726 transitions. [2019-09-08 12:04:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:04:52,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:52,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:52,033 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash -272719777, now seen corresponding path program 1 times [2019-09-08 12:04:52,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:52,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:52,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:52,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:52,186 INFO L87 Difference]: Start difference. First operand 547 states and 726 transitions. Second operand 9 states. [2019-09-08 12:04:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:53,618 INFO L93 Difference]: Finished difference Result 1244 states and 1724 transitions. [2019-09-08 12:04:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:53,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 12:04:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:53,623 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 12:04:53,623 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:53,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 725 transitions. [2019-09-08 12:04:53,678 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 725 transitions. Word has length 81 [2019-09-08 12:04:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:53,678 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 725 transitions. [2019-09-08 12:04:53,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 725 transitions. [2019-09-08 12:04:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:04:53,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:53,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:53,681 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:53,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1337474297, now seen corresponding path program 1 times [2019-09-08 12:04:53,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:53,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:53,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:53,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:53,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:53,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:53,835 INFO L87 Difference]: Start difference. First operand 547 states and 725 transitions. Second operand 9 states. [2019-09-08 12:04:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:55,030 INFO L93 Difference]: Finished difference Result 1256 states and 1738 transitions. [2019-09-08 12:04:55,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:55,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:04:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:55,035 INFO L225 Difference]: With dead ends: 1256 [2019-09-08 12:04:55,035 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:04:55,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:04:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:04:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 723 transitions. [2019-09-08 12:04:55,093 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 723 transitions. Word has length 83 [2019-09-08 12:04:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:55,093 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 723 transitions. [2019-09-08 12:04:55,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 723 transitions. [2019-09-08 12:04:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:04:55,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:55,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:55,096 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1331235743, now seen corresponding path program 1 times [2019-09-08 12:04:55,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:55,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:55,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:55,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:55,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:55,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:55,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:55,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:55,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:55,305 INFO L87 Difference]: Start difference. First operand 547 states and 723 transitions. Second operand 9 states. [2019-09-08 12:04:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:56,880 INFO L93 Difference]: Finished difference Result 1216 states and 1676 transitions. [2019-09-08 12:04:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:56,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:04:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:56,886 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 12:04:56,886 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:04:56,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:04:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:04:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 721 transitions. [2019-09-08 12:04:56,935 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 721 transitions. Word has length 83 [2019-09-08 12:04:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:56,935 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 721 transitions. [2019-09-08 12:04:56,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 721 transitions. [2019-09-08 12:04:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:04:56,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:56,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:56,938 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:56,938 INFO L82 PathProgramCache]: Analyzing trace with hash 11721297, now seen corresponding path program 1 times [2019-09-08 12:04:56,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:56,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:56,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:57,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:57,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:57,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:57,077 INFO L87 Difference]: Start difference. First operand 547 states and 721 transitions. Second operand 9 states. [2019-09-08 12:04:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:58,680 INFO L93 Difference]: Finished difference Result 1320 states and 1823 transitions. [2019-09-08 12:04:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:04:58,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:04:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:58,685 INFO L225 Difference]: With dead ends: 1320 [2019-09-08 12:04:58,685 INFO L226 Difference]: Without dead ends: 1130 [2019-09-08 12:04:58,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:04:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-08 12:04:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 547. [2019-09-08 12:04:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:04:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 719 transitions. [2019-09-08 12:04:58,745 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 719 transitions. Word has length 83 [2019-09-08 12:04:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:58,746 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 719 transitions. [2019-09-08 12:04:58,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:04:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 719 transitions. [2019-09-08 12:04:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:04:58,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:58,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:04:58,748 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash 116579511, now seen corresponding path program 1 times [2019-09-08 12:04:58,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:58,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:58,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:58,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:58,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:04:58,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:58,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:04:58,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:04:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:04:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:04:58,903 INFO L87 Difference]: Start difference. First operand 547 states and 719 transitions. Second operand 9 states. [2019-09-08 12:05:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:00,157 INFO L93 Difference]: Finished difference Result 1087 states and 1477 transitions. [2019-09-08 12:05:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:00,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:00,162 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 12:05:00,162 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:00,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 717 transitions. [2019-09-08 12:05:00,203 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 717 transitions. Word has length 83 [2019-09-08 12:05:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:00,204 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 717 transitions. [2019-09-08 12:05:00,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 717 transitions. [2019-09-08 12:05:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:00,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:00,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:00,206 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:00,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2029458257, now seen corresponding path program 1 times [2019-09-08 12:05:00,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:00,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:00,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:00,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-09-08 12:05:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:00,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:00,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:00,341 INFO L87 Difference]: Start difference. First operand 547 states and 717 transitions. Second operand 9 states. [2019-09-08 12:05:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:01,813 INFO L93 Difference]: Finished difference Result 1212 states and 1665 transitions. [2019-09-08 12:05:01,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:01,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:01,817 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 12:05:01,817 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:01,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 715 transitions. [2019-09-08 12:05:01,876 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 715 transitions. Word has length 83 [2019-09-08 12:05:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:01,877 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 715 transitions. [2019-09-08 12:05:01,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 715 transitions. [2019-09-08 12:05:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:01,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:01,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:01,879 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2037194958, now seen corresponding path program 1 times [2019-09-08 12:05:01,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:01,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:01,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:01,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:02,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:02,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:02,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:02,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:02,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:02,024 INFO L87 Difference]: Start difference. First operand 547 states and 715 transitions. Second operand 9 states. [2019-09-08 12:05:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:03,642 INFO L93 Difference]: Finished difference Result 1087 states and 1473 transitions. [2019-09-08 12:05:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:03,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:03,649 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 12:05:03,649 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:03,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 713 transitions. [2019-09-08 12:05:03,698 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 713 transitions. Word has length 83 [2019-09-08 12:05:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:03,698 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 713 transitions. [2019-09-08 12:05:03,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 713 transitions. [2019-09-08 12:05:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:03,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:03,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:03,700 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:03,700 INFO L82 PathProgramCache]: Analyzing trace with hash -315572149, now seen corresponding path program 1 times [2019-09-08 12:05:03,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:03,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:03,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:03,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:03,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:03,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:03,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:03,840 INFO L87 Difference]: Start difference. First operand 547 states and 713 transitions. Second operand 9 states. [2019-09-08 12:05:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:05,249 INFO L93 Difference]: Finished difference Result 1087 states and 1469 transitions. [2019-09-08 12:05:05,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:05,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:05,255 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 12:05:05,255 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:05,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 712 transitions. [2019-09-08 12:05:05,300 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 712 transitions. Word has length 83 [2019-09-08 12:05:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:05,301 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 712 transitions. [2019-09-08 12:05:05,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 712 transitions. [2019-09-08 12:05:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:05,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:05,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:05,303 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash -697978443, now seen corresponding path program 1 times [2019-09-08 12:05:05,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:05,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:05,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:05,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:05,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:05,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:05,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:05,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:05,443 INFO L87 Difference]: Start difference. First operand 547 states and 712 transitions. Second operand 9 states. [2019-09-08 12:05:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:07,003 INFO L93 Difference]: Finished difference Result 1210 states and 1655 transitions. [2019-09-08 12:05:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:07,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:07,008 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 12:05:07,008 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:07,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 711 transitions. [2019-09-08 12:05:07,056 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 711 transitions. Word has length 83 [2019-09-08 12:05:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:07,056 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 711 transitions. [2019-09-08 12:05:07,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 711 transitions. [2019-09-08 12:05:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:07,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:07,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:07,057 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1927606278, now seen corresponding path program 1 times [2019-09-08 12:05:07,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:07,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:07,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:07,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:07,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:07,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:07,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:07,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:07,206 INFO L87 Difference]: Start difference. First operand 547 states and 711 transitions. Second operand 9 states. [2019-09-08 12:05:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:08,787 INFO L93 Difference]: Finished difference Result 1210 states and 1654 transitions. [2019-09-08 12:05:08,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:08,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:08,791 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 12:05:08,791 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:08,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 710 transitions. [2019-09-08 12:05:08,846 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 710 transitions. Word has length 83 [2019-09-08 12:05:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:08,846 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 710 transitions. [2019-09-08 12:05:08,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 710 transitions. [2019-09-08 12:05:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:08,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:08,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:08,848 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash 416569401, now seen corresponding path program 1 times [2019-09-08 12:05:08,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:08,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:08,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:08,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:08,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:08,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:08,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:08,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:08,995 INFO L87 Difference]: Start difference. First operand 547 states and 710 transitions. Second operand 9 states. [2019-09-08 12:05:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:10,420 INFO L93 Difference]: Finished difference Result 1213 states and 1655 transitions. [2019-09-08 12:05:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:10,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:10,425 INFO L225 Difference]: With dead ends: 1213 [2019-09-08 12:05:10,426 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:10,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 709 transitions. [2019-09-08 12:05:10,476 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 709 transitions. Word has length 83 [2019-09-08 12:05:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:10,476 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 709 transitions. [2019-09-08 12:05:10,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 709 transitions. [2019-09-08 12:05:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:10,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:10,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:10,478 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash -961144879, now seen corresponding path program 1 times [2019-09-08 12:05:10,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:10,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:10,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:10,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:10,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:10,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:10,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:10,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:10,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:10,657 INFO L87 Difference]: Start difference. First operand 547 states and 709 transitions. Second operand 9 states. [2019-09-08 12:05:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:11,952 INFO L93 Difference]: Finished difference Result 1249 states and 1706 transitions. [2019-09-08 12:05:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:11,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:11,959 INFO L225 Difference]: With dead ends: 1249 [2019-09-08 12:05:11,959 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 12:05:11,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 12:05:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 547. [2019-09-08 12:05:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 708 transitions. [2019-09-08 12:05:12,012 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 708 transitions. Word has length 83 [2019-09-08 12:05:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:12,012 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 708 transitions. [2019-09-08 12:05:12,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 708 transitions. [2019-09-08 12:05:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:12,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:12,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:12,013 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1104924732, now seen corresponding path program 1 times [2019-09-08 12:05:12,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:12,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:12,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:12,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:12,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:12,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:12,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:12,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:12,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:12,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:12,142 INFO L87 Difference]: Start difference. First operand 547 states and 708 transitions. Second operand 9 states. [2019-09-08 12:05:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:13,592 INFO L93 Difference]: Finished difference Result 1213 states and 1653 transitions. [2019-09-08 12:05:13,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:13,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:13,596 INFO L225 Difference]: With dead ends: 1213 [2019-09-08 12:05:13,596 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:13,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 707 transitions. [2019-09-08 12:05:13,662 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 707 transitions. Word has length 83 [2019-09-08 12:05:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:13,663 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 707 transitions. [2019-09-08 12:05:13,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 707 transitions. [2019-09-08 12:05:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 12:05:13,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:13,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:13,664 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831093, now seen corresponding path program 1 times [2019-09-08 12:05:13,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:13,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:13,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:13,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:13,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:13,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:13,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:13,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:13,805 INFO L87 Difference]: Start difference. First operand 547 states and 707 transitions. Second operand 9 states. [2019-09-08 12:05:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:15,262 INFO L93 Difference]: Finished difference Result 1210 states and 1648 transitions. [2019-09-08 12:05:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:15,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 12:05:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:15,265 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 12:05:15,265 INFO L226 Difference]: Without dead ends: 1082 [2019-09-08 12:05:15,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:15,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-08 12:05:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 547. [2019-09-08 12:05:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 706 transitions. [2019-09-08 12:05:15,317 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 706 transitions. Word has length 83 [2019-09-08 12:05:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:15,318 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 706 transitions. [2019-09-08 12:05:15,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 706 transitions. [2019-09-08 12:05:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:05:15,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:15,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:15,319 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1207818414, now seen corresponding path program 1 times [2019-09-08 12:05:15,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:15,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:15,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:15,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:15,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:05:15,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:05:15,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:05:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:05:15,477 INFO L87 Difference]: Start difference. First operand 547 states and 706 transitions. Second operand 9 states. [2019-09-08 12:05:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:16,894 INFO L93 Difference]: Finished difference Result 1208 states and 1645 transitions. [2019-09-08 12:05:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:05:16,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-08 12:05:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:16,897 INFO L225 Difference]: With dead ends: 1208 [2019-09-08 12:05:16,897 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:05:16,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:05:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:05:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 546. [2019-09-08 12:05:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-08 12:05:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 704 transitions. [2019-09-08 12:05:16,986 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 704 transitions. Word has length 84 [2019-09-08 12:05:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:16,987 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 704 transitions. [2019-09-08 12:05:16,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:05:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 704 transitions. [2019-09-08 12:05:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:16,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:16,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:16,988 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1370154188, now seen corresponding path program 1 times [2019-09-08 12:05:16,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:16,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:16,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:16,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:16,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:18,018 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 12:05:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:18,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:18,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:05:18,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:05:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:05:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:05:18,909 INFO L87 Difference]: Start difference. First operand 546 states and 704 transitions. Second operand 26 states. [2019-09-08 12:05:19,054 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:05:20,101 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:05:20,313 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-08 12:05:20,587 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-08 12:05:20,965 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-09-08 12:05:21,169 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 12:05:21,373 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-08 12:05:21,607 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 12:05:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:25,723 INFO L93 Difference]: Finished difference Result 883 states and 1164 transitions. [2019-09-08 12:05:25,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:05:25,724 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2019-09-08 12:05:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:25,726 INFO L225 Difference]: With dead ends: 883 [2019-09-08 12:05:25,727 INFO L226 Difference]: Without dead ends: 753 [2019-09-08 12:05:25,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:05:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-08 12:05:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 561. [2019-09-08 12:05:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-08 12:05:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 725 transitions. [2019-09-08 12:05:25,798 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 725 transitions. Word has length 85 [2019-09-08 12:05:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:25,799 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 725 transitions. [2019-09-08 12:05:25,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:05:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 725 transitions. [2019-09-08 12:05:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:25,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:25,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:25,801 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:25,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:25,802 INFO L82 PathProgramCache]: Analyzing trace with hash -230689484, now seen corresponding path program 1 times [2019-09-08 12:05:25,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:25,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:25,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:25,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:25,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:26,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:26,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:26,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:26,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:26,518 INFO L87 Difference]: Start difference. First operand 561 states and 725 transitions. Second operand 17 states. [2019-09-08 12:05:27,124 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:05:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:29,271 INFO L93 Difference]: Finished difference Result 1341 states and 1824 transitions. [2019-09-08 12:05:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:05:29,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:05:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:29,274 INFO L225 Difference]: With dead ends: 1341 [2019-09-08 12:05:29,274 INFO L226 Difference]: Without dead ends: 1169 [2019-09-08 12:05:29,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:05:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-09-08 12:05:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 541. [2019-09-08 12:05:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 12:05:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 696 transitions. [2019-09-08 12:05:29,345 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 696 transitions. Word has length 85 [2019-09-08 12:05:29,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:29,346 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 696 transitions. [2019-09-08 12:05:29,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:05:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 696 transitions. [2019-09-08 12:05:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:29,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:29,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:29,347 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:29,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:29,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1185402698, now seen corresponding path program 1 times [2019-09-08 12:05:29,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:29,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:29,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:29,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:29,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:30,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:30,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:05:30,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:05:30,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:05:30,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:05:30,076 INFO L87 Difference]: Start difference. First operand 541 states and 696 transitions. Second operand 16 states. [2019-09-08 12:05:30,684 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 12:05:30,821 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:05:30,960 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:05:31,125 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:05:31,282 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 12:05:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:33,385 INFO L93 Difference]: Finished difference Result 877 states and 1110 transitions. [2019-09-08 12:05:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:05:33,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2019-09-08 12:05:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:33,387 INFO L225 Difference]: With dead ends: 877 [2019-09-08 12:05:33,387 INFO L226 Difference]: Without dead ends: 873 [2019-09-08 12:05:33,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:05:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-09-08 12:05:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 547. [2019-09-08 12:05:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-08 12:05:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 704 transitions. [2019-09-08 12:05:33,458 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 704 transitions. Word has length 85 [2019-09-08 12:05:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:33,458 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 704 transitions. [2019-09-08 12:05:33,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:05:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 704 transitions. [2019-09-08 12:05:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:33,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:33,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:33,460 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1294662844, now seen corresponding path program 1 times [2019-09-08 12:05:33,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:33,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:33,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:34,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:34,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:34,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:34,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:34,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:34,157 INFO L87 Difference]: Start difference. First operand 547 states and 704 transitions. Second operand 17 states. [2019-09-08 12:05:34,692 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:05:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:35,828 INFO L93 Difference]: Finished difference Result 983 states and 1323 transitions. [2019-09-08 12:05:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:05:35,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:05:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:35,830 INFO L225 Difference]: With dead ends: 983 [2019-09-08 12:05:35,830 INFO L226 Difference]: Without dead ends: 763 [2019-09-08 12:05:35,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:05:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-08 12:05:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 505. [2019-09-08 12:05:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:05:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 647 transitions. [2019-09-08 12:05:35,899 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 647 transitions. Word has length 85 [2019-09-08 12:05:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:35,899 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 647 transitions. [2019-09-08 12:05:35,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:05:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 647 transitions. [2019-09-08 12:05:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:35,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:35,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:35,902 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:35,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash 181793350, now seen corresponding path program 1 times [2019-09-08 12:05:35,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:35,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:35,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:35,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:35,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:36,961 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 12:05:37,111 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 12:05:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:37,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:37,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 12:05:37,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 12:05:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 12:05:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:05:37,797 INFO L87 Difference]: Start difference. First operand 505 states and 647 transitions. Second operand 27 states. [2019-09-08 12:05:37,940 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-08 12:05:38,799 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-08 12:05:39,252 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-08 12:05:39,580 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 12:05:39,969 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-08 12:05:40,402 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-08 12:05:40,610 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:05:40,865 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 12:05:41,079 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-08 12:05:41,311 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:05:41,537 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:05:41,834 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:05:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:45,145 INFO L93 Difference]: Finished difference Result 817 states and 1075 transitions. [2019-09-08 12:05:45,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:05:45,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2019-09-08 12:05:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:45,147 INFO L225 Difference]: With dead ends: 817 [2019-09-08 12:05:45,147 INFO L226 Difference]: Without dead ends: 684 [2019-09-08 12:05:45,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 12:05:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-09-08 12:05:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 516. [2019-09-08 12:05:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 12:05:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 659 transitions. [2019-09-08 12:05:45,283 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 659 transitions. Word has length 85 [2019-09-08 12:05:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:45,284 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 659 transitions. [2019-09-08 12:05:45,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 12:05:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 659 transitions. [2019-09-08 12:05:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:45,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:45,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:45,286 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 151515162, now seen corresponding path program 1 times [2019-09-08 12:05:45,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:45,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:45,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:46,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:46,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:46,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:46,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:46,004 INFO L87 Difference]: Start difference. First operand 516 states and 659 transitions. Second operand 17 states. [2019-09-08 12:05:46,538 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:05:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:47,951 INFO L93 Difference]: Finished difference Result 982 states and 1333 transitions. [2019-09-08 12:05:47,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:05:47,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:05:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:47,958 INFO L225 Difference]: With dead ends: 982 [2019-09-08 12:05:47,958 INFO L226 Difference]: Without dead ends: 806 [2019-09-08 12:05:47,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:05:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-09-08 12:05:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 487. [2019-09-08 12:05:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-08 12:05:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 621 transitions. [2019-09-08 12:05:48,030 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 621 transitions. Word has length 85 [2019-09-08 12:05:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:48,031 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 621 transitions. [2019-09-08 12:05:48,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:05:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 621 transitions. [2019-09-08 12:05:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:48,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:48,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:48,032 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 626554292, now seen corresponding path program 1 times [2019-09-08 12:05:48,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:48,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:48,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:48,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:05:48,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:05:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:05:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:05:48,773 INFO L87 Difference]: Start difference. First operand 487 states and 621 transitions. Second operand 17 states. [2019-09-08 12:05:49,372 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:05:49,530 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:05:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:51,747 INFO L93 Difference]: Finished difference Result 1150 states and 1569 transitions. [2019-09-08 12:05:51,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:05:51,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-08 12:05:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:51,750 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 12:05:51,750 INFO L226 Difference]: Without dead ends: 1017 [2019-09-08 12:05:51,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:05:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-09-08 12:05:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 486. [2019-09-08 12:05:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-08 12:05:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 618 transitions. [2019-09-08 12:05:51,890 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 618 transitions. Word has length 85 [2019-09-08 12:05:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:51,892 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 618 transitions. [2019-09-08 12:05:51,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:05:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 618 transitions. [2019-09-08 12:05:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:51,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:51,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:51,894 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:51,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1764599692, now seen corresponding path program 1 times [2019-09-08 12:05:51,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:51,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:51,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:51,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:51,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:53,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:53,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:05:53,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:05:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:05:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:05:53,352 INFO L87 Difference]: Start difference. First operand 486 states and 618 transitions. Second operand 25 states. [2019-09-08 12:05:54,323 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:05:54,613 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-08 12:05:54,872 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-08 12:05:55,171 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-08 12:05:55,368 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:05:55,561 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:05:55,753 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:05:55,930 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 12:05:56,193 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 12:05:56,455 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 12:05:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:59,419 INFO L93 Difference]: Finished difference Result 930 states and 1238 transitions. [2019-09-08 12:05:59,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:05:59,420 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-09-08 12:05:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:59,422 INFO L225 Difference]: With dead ends: 930 [2019-09-08 12:05:59,422 INFO L226 Difference]: Without dead ends: 776 [2019-09-08 12:05:59,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:05:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-09-08 12:05:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 497. [2019-09-08 12:05:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-08 12:05:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 630 transitions. [2019-09-08 12:05:59,503 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 630 transitions. Word has length 85 [2019-09-08 12:05:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:59,503 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 630 transitions. [2019-09-08 12:05:59,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:05:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 630 transitions. [2019-09-08 12:05:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:05:59,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:59,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:59,504 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1793652703, now seen corresponding path program 1 times [2019-09-08 12:05:59,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:59,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:59,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:00,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:06:00,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:06:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:06:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:00,042 INFO L87 Difference]: Start difference. First operand 497 states and 630 transitions. Second operand 15 states. [2019-09-08 12:06:00,511 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-08 12:06:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:01,721 INFO L93 Difference]: Finished difference Result 889 states and 1191 transitions. [2019-09-08 12:06:01,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:06:01,721 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-09-08 12:06:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:01,724 INFO L225 Difference]: With dead ends: 889 [2019-09-08 12:06:01,724 INFO L226 Difference]: Without dead ends: 663 [2019-09-08 12:06:01,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:06:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-08 12:06:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 456. [2019-09-08 12:06:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-08 12:06:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 581 transitions. [2019-09-08 12:06:01,870 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 581 transitions. Word has length 85 [2019-09-08 12:06:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:01,870 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 581 transitions. [2019-09-08 12:06:01,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:06:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 581 transitions. [2019-09-08 12:06:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:01,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:01,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:01,880 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2017902633, now seen corresponding path program 1 times [2019-09-08 12:06:01,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:01,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:01,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:02,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:06:02,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:06:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:06:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:06:02,019 INFO L87 Difference]: Start difference. First operand 456 states and 581 transitions. Second operand 9 states. [2019-09-08 12:06:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:03,147 INFO L93 Difference]: Finished difference Result 1098 states and 1505 transitions. [2019-09-08 12:06:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:06:03,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:06:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:03,149 INFO L225 Difference]: With dead ends: 1098 [2019-09-08 12:06:03,149 INFO L226 Difference]: Without dead ends: 942 [2019-09-08 12:06:03,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:06:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-08 12:06:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 456. [2019-09-08 12:06:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-08 12:06:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 578 transitions. [2019-09-08 12:06:03,237 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 578 transitions. Word has length 86 [2019-09-08 12:06:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:03,237 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 578 transitions. [2019-09-08 12:06:03,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:06:03,237 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 578 transitions. [2019-09-08 12:06:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:03,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:03,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:03,239 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:03,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1859590783, now seen corresponding path program 1 times [2019-09-08 12:06:03,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:03,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:03,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:03,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:03,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:03,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:06:03,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:06:03,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:06:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:06:03,390 INFO L87 Difference]: Start difference. First operand 456 states and 578 transitions. Second operand 9 states. [2019-09-08 12:06:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:04,644 INFO L93 Difference]: Finished difference Result 936 states and 1261 transitions. [2019-09-08 12:06:04,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:06:04,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 12:06:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:04,646 INFO L225 Difference]: With dead ends: 936 [2019-09-08 12:06:04,646 INFO L226 Difference]: Without dead ends: 929 [2019-09-08 12:06:04,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:06:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-08 12:06:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 456. [2019-09-08 12:06:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-08 12:06:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 575 transitions. [2019-09-08 12:06:04,743 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 575 transitions. Word has length 86 [2019-09-08 12:06:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:04,743 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 575 transitions. [2019-09-08 12:06:04,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:06:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 575 transitions. [2019-09-08 12:06:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:04,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:04,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:04,745 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash 163610703, now seen corresponding path program 1 times [2019-09-08 12:06:04,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:04,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:04,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:05,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:05,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:06:05,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:06:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:06:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:06:05,160 INFO L87 Difference]: Start difference. First operand 456 states and 575 transitions. Second operand 12 states. [2019-09-08 12:06:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:06,415 INFO L93 Difference]: Finished difference Result 1405 states and 1945 transitions. [2019-09-08 12:06:06,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:06:06,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-08 12:06:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:06,417 INFO L225 Difference]: With dead ends: 1405 [2019-09-08 12:06:06,417 INFO L226 Difference]: Without dead ends: 1245 [2019-09-08 12:06:06,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:06:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-09-08 12:06:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 422. [2019-09-08 12:06:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-08 12:06:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 533 transitions. [2019-09-08 12:06:06,499 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 533 transitions. Word has length 86 [2019-09-08 12:06:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:06,499 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 533 transitions. [2019-09-08 12:06:06,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:06:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 533 transitions. [2019-09-08 12:06:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:06,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:06,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:06,500 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 28003791, now seen corresponding path program 1 times [2019-09-08 12:06:06,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:06,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:06,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:07,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:07,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:06:07,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:06:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:06:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:06:07,096 INFO L87 Difference]: Start difference. First operand 422 states and 533 transitions. Second operand 16 states. [2019-09-08 12:06:08,185 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:06:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:09,724 INFO L93 Difference]: Finished difference Result 1361 states and 1888 transitions. [2019-09-08 12:06:09,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:06:09,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:06:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:09,726 INFO L225 Difference]: With dead ends: 1361 [2019-09-08 12:06:09,726 INFO L226 Difference]: Without dead ends: 1213 [2019-09-08 12:06:09,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:06:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-08 12:06:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 434. [2019-09-08 12:06:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 12:06:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 547 transitions. [2019-09-08 12:06:09,813 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 547 transitions. Word has length 86 [2019-09-08 12:06:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:09,814 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 547 transitions. [2019-09-08 12:06:09,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:06:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 547 transitions. [2019-09-08 12:06:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:09,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:09,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:09,815 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash 676927323, now seen corresponding path program 1 times [2019-09-08 12:06:09,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:09,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:09,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:10,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:10,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:06:10,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:06:10,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:06:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:06:10,380 INFO L87 Difference]: Start difference. First operand 434 states and 547 transitions. Second operand 16 states. [2019-09-08 12:06:11,313 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:06:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:12,241 INFO L93 Difference]: Finished difference Result 795 states and 1051 transitions. [2019-09-08 12:06:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:06:12,241 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:06:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:12,242 INFO L225 Difference]: With dead ends: 795 [2019-09-08 12:06:12,242 INFO L226 Difference]: Without dead ends: 653 [2019-09-08 12:06:12,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:06:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-08 12:06:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 418. [2019-09-08 12:06:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-08 12:06:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 526 transitions. [2019-09-08 12:06:12,327 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 526 transitions. Word has length 86 [2019-09-08 12:06:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:12,327 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 526 transitions. [2019-09-08 12:06:12,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:06:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 526 transitions. [2019-09-08 12:06:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:12,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:12,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:12,328 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1971516155, now seen corresponding path program 1 times [2019-09-08 12:06:12,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:12,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:12,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:12,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:12,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:06:12,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:06:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:06:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:06:12,996 INFO L87 Difference]: Start difference. First operand 418 states and 526 transitions. Second operand 16 states. [2019-09-08 12:06:13,583 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:06:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:15,161 INFO L93 Difference]: Finished difference Result 778 states and 1023 transitions. [2019-09-08 12:06:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:06:15,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-08 12:06:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:15,163 INFO L225 Difference]: With dead ends: 778 [2019-09-08 12:06:15,163 INFO L226 Difference]: Without dead ends: 648 [2019-09-08 12:06:15,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:06:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-08 12:06:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 401. [2019-09-08 12:06:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-09-08 12:06:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 503 transitions. [2019-09-08 12:06:15,295 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 503 transitions. Word has length 86 [2019-09-08 12:06:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:15,296 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 503 transitions. [2019-09-08 12:06:15,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:06:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 503 transitions. [2019-09-08 12:06:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:15,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:15,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:15,297 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:15,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1312927659, now seen corresponding path program 1 times [2019-09-08 12:06:15,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:15,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:15,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:15,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:06:15,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:06:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:06:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:06:15,682 INFO L87 Difference]: Start difference. First operand 401 states and 503 transitions. Second operand 12 states. [2019-09-08 12:06:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:16,890 INFO L93 Difference]: Finished difference Result 752 states and 992 transitions. [2019-09-08 12:06:16,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:06:16,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-08 12:06:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:16,892 INFO L225 Difference]: With dead ends: 752 [2019-09-08 12:06:16,892 INFO L226 Difference]: Without dead ends: 622 [2019-09-08 12:06:16,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:06:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-08 12:06:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 397. [2019-09-08 12:06:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 12:06:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 498 transitions. [2019-09-08 12:06:16,978 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 498 transitions. Word has length 86 [2019-09-08 12:06:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:16,979 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 498 transitions. [2019-09-08 12:06:16,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:06:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 498 transitions. [2019-09-08 12:06:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:16,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:16,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:16,980 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1341980670, now seen corresponding path program 1 times [2019-09-08 12:06:16,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:16,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:16,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:16,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:16,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:17,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:17,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:06:17,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:06:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:06:17,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:06:17,572 INFO L87 Difference]: Start difference. First operand 397 states and 498 transitions. Second operand 17 states. [2019-09-08 12:06:18,281 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:06:18,709 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 12:06:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:20,129 INFO L93 Difference]: Finished difference Result 1061 states and 1481 transitions. [2019-09-08 12:06:20,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:06:20,129 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-08 12:06:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:20,131 INFO L225 Difference]: With dead ends: 1061 [2019-09-08 12:06:20,131 INFO L226 Difference]: Without dead ends: 911 [2019-09-08 12:06:20,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:06:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-09-08 12:06:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 373. [2019-09-08 12:06:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 12:06:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 467 transitions. [2019-09-08 12:06:20,221 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 467 transitions. Word has length 86 [2019-09-08 12:06:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:20,221 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 467 transitions. [2019-09-08 12:06:20,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:06:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 467 transitions. [2019-09-08 12:06:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 12:06:20,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:20,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:20,222 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 151346387, now seen corresponding path program 1 times [2019-09-08 12:06:20,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:20,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:20,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:06:20,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:06:20,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:06:20,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:20,875 INFO L87 Difference]: Start difference. First operand 373 states and 467 transitions. Second operand 15 states. [2019-09-08 12:06:21,068 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-08 12:06:21,415 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:06:21,638 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:06:21,892 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 12:06:22,105 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-08 12:06:22,333 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-08 12:06:22,551 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-08 12:06:22,941 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-08 12:06:23,440 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-08 12:06:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:25,488 INFO L93 Difference]: Finished difference Result 1825 states and 2582 transitions. [2019-09-08 12:06:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:06:25,489 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-08 12:06:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:25,491 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:06:25,491 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:06:25,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:06:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:06:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 341. [2019-09-08 12:06:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-08 12:06:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 429 transitions. [2019-09-08 12:06:25,606 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 429 transitions. Word has length 86 [2019-09-08 12:06:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:25,607 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 429 transitions. [2019-09-08 12:06:25,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:06:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 429 transitions. [2019-09-08 12:06:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:06:25,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:25,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:25,607 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:25,608 INFO L82 PathProgramCache]: Analyzing trace with hash 470342809, now seen corresponding path program 1 times [2019-09-08 12:06:25,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:25,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:25,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:25,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:25,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:25,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:25,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:06:25,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:06:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:06:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:06:25,734 INFO L87 Difference]: Start difference. First operand 341 states and 429 transitions. Second operand 9 states. [2019-09-08 12:06:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:26,502 INFO L93 Difference]: Finished difference Result 548 states and 708 transitions. [2019-09-08 12:06:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:06:26,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:06:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:26,504 INFO L225 Difference]: With dead ends: 548 [2019-09-08 12:06:26,504 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 12:06:26,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:06:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 12:06:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 341. [2019-09-08 12:06:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-08 12:06:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 427 transitions. [2019-09-08 12:06:26,593 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 427 transitions. Word has length 87 [2019-09-08 12:06:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:26,593 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 427 transitions. [2019-09-08 12:06:26,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:06:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 427 transitions. [2019-09-08 12:06:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:06:26,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:26,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:26,595 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:26,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:26,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1658746276, now seen corresponding path program 1 times [2019-09-08 12:06:26,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:26,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:26,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:26,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:26,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:26,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:26,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:06:26,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:06:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:06:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:06:26,956 INFO L87 Difference]: Start difference. First operand 341 states and 427 transitions. Second operand 9 states. [2019-09-08 12:06:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:27,634 INFO L93 Difference]: Finished difference Result 889 states and 1227 transitions. [2019-09-08 12:06:27,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:27,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 12:06:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:27,636 INFO L225 Difference]: With dead ends: 889 [2019-09-08 12:06:27,636 INFO L226 Difference]: Without dead ends: 723 [2019-09-08 12:06:27,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:06:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-08 12:06:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 301. [2019-09-08 12:06:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-08 12:06:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 382 transitions. [2019-09-08 12:06:27,727 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 382 transitions. Word has length 87 [2019-09-08 12:06:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:27,727 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 382 transitions. [2019-09-08 12:06:27,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:06:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 382 transitions. [2019-09-08 12:06:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:06:27,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:27,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:27,728 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash -266310598, now seen corresponding path program 1 times [2019-09-08 12:06:27,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:27,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:27,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:28,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-09-08 12:06:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:06:28,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:06:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:06:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:06:28,189 INFO L87 Difference]: Start difference. First operand 301 states and 382 transitions. Second operand 13 states. [2019-09-08 12:06:28,691 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-09-08 12:06:28,906 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:06:29,104 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:06:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:29,689 INFO L93 Difference]: Finished difference Result 609 states and 827 transitions. [2019-09-08 12:06:29,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:06:29,690 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-08 12:06:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:29,691 INFO L225 Difference]: With dead ends: 609 [2019-09-08 12:06:29,692 INFO L226 Difference]: Without dead ends: 565 [2019-09-08 12:06:29,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:06:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-08 12:06:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 257. [2019-09-08 12:06:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-08 12:06:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 333 transitions. [2019-09-08 12:06:29,778 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 333 transitions. Word has length 87 [2019-09-08 12:06:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:29,778 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 333 transitions. [2019-09-08 12:06:29,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:06:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 333 transitions. [2019-09-08 12:06:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:06:29,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:29,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:29,779 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1545293458, now seen corresponding path program 1 times [2019-09-08 12:06:29,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:29,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:29,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:30,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:30,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:06:30,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:06:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:06:30,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:06:30,816 INFO L87 Difference]: Start difference. First operand 257 states and 333 transitions. Second operand 16 states. [2019-09-08 12:06:31,592 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-08 12:06:31,748 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:06:31,904 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:06:32,046 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 12:06:32,260 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-08 12:06:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:33,452 INFO L93 Difference]: Finished difference Result 950 states and 1350 transitions. [2019-09-08 12:06:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:06:33,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-08 12:06:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:33,454 INFO L225 Difference]: With dead ends: 950 [2019-09-08 12:06:33,454 INFO L226 Difference]: Without dead ends: 944 [2019-09-08 12:06:33,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:06:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-08 12:06:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 257. [2019-09-08 12:06:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-08 12:06:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 332 transitions. [2019-09-08 12:06:33,550 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 332 transitions. Word has length 88 [2019-09-08 12:06:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:33,550 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 332 transitions. [2019-09-08 12:06:33,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:06:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 332 transitions. [2019-09-08 12:06:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:06:33,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:33,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:33,551 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1695614251, now seen corresponding path program 1 times [2019-09-08 12:06:33,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:33,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:33,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:33,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:33,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:06:33,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:06:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:06:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:06:33,903 INFO L87 Difference]: Start difference. First operand 257 states and 332 transitions. Second operand 11 states. [2019-09-08 12:06:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:35,273 INFO L93 Difference]: Finished difference Result 953 states and 1353 transitions. [2019-09-08 12:06:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:06:35,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 12:06:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:35,275 INFO L225 Difference]: With dead ends: 953 [2019-09-08 12:06:35,275 INFO L226 Difference]: Without dead ends: 947 [2019-09-08 12:06:35,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:06:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-09-08 12:06:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 251. [2019-09-08 12:06:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-08 12:06:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 326 transitions. [2019-09-08 12:06:35,377 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 326 transitions. Word has length 89 [2019-09-08 12:06:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:35,378 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 326 transitions. [2019-09-08 12:06:35,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:06:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 326 transitions. [2019-09-08 12:06:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:06:35,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:35,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:35,379 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:35,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1499104933, now seen corresponding path program 1 times [2019-09-08 12:06:35,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:35,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:35,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:35,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:35,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:35,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:35,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:35,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:35,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:35,450 INFO L87 Difference]: Start difference. First operand 251 states and 326 transitions. Second operand 3 states. [2019-09-08 12:06:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:35,697 INFO L93 Difference]: Finished difference Result 495 states and 690 transitions. [2019-09-08 12:06:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:35,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 12:06:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:35,699 INFO L225 Difference]: With dead ends: 495 [2019-09-08 12:06:35,699 INFO L226 Difference]: Without dead ends: 369 [2019-09-08 12:06:35,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-08 12:06:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2019-09-08 12:06:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-08 12:06:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 497 transitions. [2019-09-08 12:06:35,872 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 497 transitions. Word has length 115 [2019-09-08 12:06:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:35,873 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 497 transitions. [2019-09-08 12:06:35,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 497 transitions. [2019-09-08 12:06:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:06:35,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:35,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:35,874 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash -527865099, now seen corresponding path program 1 times [2019-09-08 12:06:35,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:35,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:35,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:35,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:35,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:35,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:35,949 INFO L87 Difference]: Start difference. First operand 367 states and 497 transitions. Second operand 3 states. [2019-09-08 12:06:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:36,258 INFO L93 Difference]: Finished difference Result 831 states and 1183 transitions. [2019-09-08 12:06:36,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:36,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 12:06:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:36,264 INFO L225 Difference]: With dead ends: 831 [2019-09-08 12:06:36,264 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 12:06:36,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 12:06:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-09-08 12:06:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 12:06:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 809 transitions. [2019-09-08 12:06:36,595 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 809 transitions. Word has length 117 [2019-09-08 12:06:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:36,595 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 809 transitions. [2019-09-08 12:06:36,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 809 transitions. [2019-09-08 12:06:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:06:36,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:36,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:36,597 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash -461371587, now seen corresponding path program 1 times [2019-09-08 12:06:36,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:36,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:36,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:36,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:36,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:36,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:36,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:06:36,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:06:36,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:06:36,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:36,668 INFO L87 Difference]: Start difference. First operand 583 states and 809 transitions. Second operand 3 states. [2019-09-08 12:06:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:37,148 INFO L93 Difference]: Finished difference Result 1275 states and 1825 transitions. [2019-09-08 12:06:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:37,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 12:06:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:37,150 INFO L225 Difference]: With dead ends: 1275 [2019-09-08 12:06:37,150 INFO L226 Difference]: Without dead ends: 817 [2019-09-08 12:06:37,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-09-08 12:06:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 815. [2019-09-08 12:06:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-09-08 12:06:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1147 transitions. [2019-09-08 12:06:37,581 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1147 transitions. Word has length 117 [2019-09-08 12:06:37,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:37,581 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1147 transitions. [2019-09-08 12:06:37,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:06:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1147 transitions. [2019-09-08 12:06:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:06:37,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:37,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:37,583 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1576522212, now seen corresponding path program 1 times [2019-09-08 12:06:37,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:37,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:37,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:37,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:37,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:37,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:37,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:37,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:37,694 INFO L87 Difference]: Start difference. First operand 815 states and 1147 transitions. Second operand 7 states. [2019-09-08 12:06:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:39,806 INFO L93 Difference]: Finished difference Result 3647 states and 5263 transitions. [2019-09-08 12:06:39,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:39,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:06:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:39,809 INFO L225 Difference]: With dead ends: 3647 [2019-09-08 12:06:39,810 INFO L226 Difference]: Without dead ends: 2957 [2019-09-08 12:06:39,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2019-09-08 12:06:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1623. [2019-09-08 12:06:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-09-08 12:06:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2325 transitions. [2019-09-08 12:06:40,759 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2325 transitions. Word has length 117 [2019-09-08 12:06:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:40,759 INFO L475 AbstractCegarLoop]: Abstraction has 1623 states and 2325 transitions. [2019-09-08 12:06:40,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2325 transitions. [2019-09-08 12:06:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:06:40,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:40,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:40,761 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash 298627100, now seen corresponding path program 1 times [2019-09-08 12:06:40,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:40,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:40,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:40,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:40,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:40,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:40,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:40,859 INFO L87 Difference]: Start difference. First operand 1623 states and 2325 transitions. Second operand 7 states. [2019-09-08 12:06:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:44,166 INFO L93 Difference]: Finished difference Result 6791 states and 9853 transitions. [2019-09-08 12:06:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:44,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:06:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:44,172 INFO L225 Difference]: With dead ends: 6791 [2019-09-08 12:06:44,172 INFO L226 Difference]: Without dead ends: 5293 [2019-09-08 12:06:44,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2019-09-08 12:06:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 3359. [2019-09-08 12:06:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-09-08 12:06:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4849 transitions. [2019-09-08 12:06:46,063 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4849 transitions. Word has length 117 [2019-09-08 12:06:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:46,063 INFO L475 AbstractCegarLoop]: Abstraction has 3359 states and 4849 transitions. [2019-09-08 12:06:46,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4849 transitions. [2019-09-08 12:06:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:06:46,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:46,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:46,065 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:46,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash 662712860, now seen corresponding path program 1 times [2019-09-08 12:06:46,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:46,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:46,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:46,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:46,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:46,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:46,142 INFO L87 Difference]: Start difference. First operand 3359 states and 4849 transitions. Second operand 7 states. [2019-09-08 12:06:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:53,016 INFO L93 Difference]: Finished difference Result 15127 states and 21965 transitions. [2019-09-08 12:06:53,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:06:53,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:06:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:53,027 INFO L225 Difference]: With dead ends: 15127 [2019-09-08 12:06:53,027 INFO L226 Difference]: Without dead ends: 11893 [2019-09-08 12:06:53,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:06:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2019-09-08 12:06:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 7071. [2019-09-08 12:06:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7071 states. [2019-09-08 12:06:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 10233 transitions. [2019-09-08 12:06:57,046 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 10233 transitions. Word has length 117 [2019-09-08 12:06:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:57,046 INFO L475 AbstractCegarLoop]: Abstraction has 7071 states and 10233 transitions. [2019-09-08 12:06:57,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:06:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 10233 transitions. [2019-09-08 12:06:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:06:57,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:57,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:06:57,049 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1403171868, now seen corresponding path program 1 times [2019-09-08 12:06:57,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:57,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:57,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:57,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:57,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:57,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:57,152 INFO L87 Difference]: Start difference. First operand 7071 states and 10233 transitions. Second operand 7 states. [2019-09-08 12:07:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:08,720 INFO L93 Difference]: Finished difference Result 27275 states and 39603 transitions. [2019-09-08 12:07:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:07:08,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-08 12:07:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:08,741 INFO L225 Difference]: With dead ends: 27275 [2019-09-08 12:07:08,741 INFO L226 Difference]: Without dead ends: 20329 [2019-09-08 12:07:08,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:07:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states. [2019-09-08 12:07:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20329 to 11679. [2019-09-08 12:07:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11679 states. [2019-09-08 12:07:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11679 states to 11679 states and 16929 transitions. [2019-09-08 12:07:15,878 INFO L78 Accepts]: Start accepts. Automaton has 11679 states and 16929 transitions. Word has length 117 [2019-09-08 12:07:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:15,878 INFO L475 AbstractCegarLoop]: Abstraction has 11679 states and 16929 transitions. [2019-09-08 12:07:15,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 11679 states and 16929 transitions. [2019-09-08 12:07:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:07:15,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:15,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:15,881 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:15,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1159936026, now seen corresponding path program 1 times [2019-09-08 12:07:15,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:15,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:15,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:15,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:15,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:15,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:15,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:07:15,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:07:15,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:07:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:07:15,960 INFO L87 Difference]: Start difference. First operand 11679 states and 16929 transitions. Second operand 7 states. [2019-09-08 12:07:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:30,272 INFO L93 Difference]: Finished difference Result 36199 states and 52309 transitions. [2019-09-08 12:07:30,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:07:30,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-08 12:07:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:30,298 INFO L225 Difference]: With dead ends: 36199 [2019-09-08 12:07:30,299 INFO L226 Difference]: Without dead ends: 24645 [2019-09-08 12:07:30,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:07:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24645 states. [2019-09-08 12:07:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24645 to 13775. [2019-09-08 12:07:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13775 states. [2019-09-08 12:07:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13775 states to 13775 states and 19809 transitions. [2019-09-08 12:07:39,162 INFO L78 Accepts]: Start accepts. Automaton has 13775 states and 19809 transitions. Word has length 118 [2019-09-08 12:07:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:39,162 INFO L475 AbstractCegarLoop]: Abstraction has 13775 states and 19809 transitions. [2019-09-08 12:07:39,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:07:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13775 states and 19809 transitions. [2019-09-08 12:07:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:07:39,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:39,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:39,165 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:39,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1593339123, now seen corresponding path program 1 times [2019-09-08 12:07:39,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:39,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:39,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:39,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:39,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:07:39,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:07:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:07:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:39,207 INFO L87 Difference]: Start difference. First operand 13775 states and 19809 transitions. Second operand 3 states. [2019-09-08 12:07:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:07:47,742 INFO L93 Difference]: Finished difference Result 28851 states and 41507 transitions. [2019-09-08 12:07:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:07:47,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:07:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:07:47,757 INFO L225 Difference]: With dead ends: 28851 [2019-09-08 12:07:47,758 INFO L226 Difference]: Without dead ends: 15201 [2019-09-08 12:07:47,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:07:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15201 states. [2019-09-08 12:07:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15201 to 15007. [2019-09-08 12:07:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15007 states. [2019-09-08 12:07:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15007 states to 15007 states and 21417 transitions. [2019-09-08 12:07:56,432 INFO L78 Accepts]: Start accepts. Automaton has 15007 states and 21417 transitions. Word has length 118 [2019-09-08 12:07:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:56,432 INFO L475 AbstractCegarLoop]: Abstraction has 15007 states and 21417 transitions. [2019-09-08 12:07:56,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15007 states and 21417 transitions. [2019-09-08 12:07:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:07:56,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:56,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:07:56,435 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:56,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1861651787, now seen corresponding path program 1 times [2019-09-08 12:07:56,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:56,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:07:56,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:07:56,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:07:56,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:07:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:07:56,519 INFO L87 Difference]: Start difference. First operand 15007 states and 21417 transitions. Second operand 6 states. [2019-09-08 12:08:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:10,908 INFO L93 Difference]: Finished difference Result 23947 states and 33621 transitions. [2019-09-08 12:08:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:08:10,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-08 12:08:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:10,934 INFO L225 Difference]: With dead ends: 23947 [2019-09-08 12:08:10,934 INFO L226 Difference]: Without dead ends: 23945 [2019-09-08 12:08:10,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:08:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23945 states. [2019-09-08 12:08:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23945 to 15199. [2019-09-08 12:08:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15199 states. [2019-09-08 12:08:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15199 states to 15199 states and 21545 transitions. [2019-09-08 12:08:19,917 INFO L78 Accepts]: Start accepts. Automaton has 15199 states and 21545 transitions. Word has length 118 [2019-09-08 12:08:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:19,917 INFO L475 AbstractCegarLoop]: Abstraction has 15199 states and 21545 transitions. [2019-09-08 12:08:19,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:08:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15199 states and 21545 transitions. [2019-09-08 12:08:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:08:19,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:19,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:19,920 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:19,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2125598154, now seen corresponding path program 1 times [2019-09-08 12:08:19,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:19,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:19,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:19,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:19,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:19,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:08:19,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:08:19,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:08:19,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:19,988 INFO L87 Difference]: Start difference. First operand 15199 states and 21545 transitions. Second operand 3 states. [2019-09-08 12:08:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:28,869 INFO L93 Difference]: Finished difference Result 29363 states and 41579 transitions. [2019-09-08 12:08:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:08:28,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-08 12:08:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:28,885 INFO L225 Difference]: With dead ends: 29363 [2019-09-08 12:08:28,886 INFO L226 Difference]: Without dead ends: 14289 [2019-09-08 12:08:28,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2019-09-08 12:08:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 12727. [2019-09-08 12:08:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12727 states. [2019-09-08 12:08:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12727 states to 12727 states and 17869 transitions. [2019-09-08 12:08:36,698 INFO L78 Accepts]: Start accepts. Automaton has 12727 states and 17869 transitions. Word has length 119 [2019-09-08 12:08:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:36,699 INFO L475 AbstractCegarLoop]: Abstraction has 12727 states and 17869 transitions. [2019-09-08 12:08:36,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:08:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12727 states and 17869 transitions. [2019-09-08 12:08:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:08:36,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:36,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:36,701 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash -45815035, now seen corresponding path program 1 times [2019-09-08 12:08:36,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:36,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:36,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:36,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:36,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:36,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:36,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:08:36,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:08:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:08:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:36,771 INFO L87 Difference]: Start difference. First operand 12727 states and 17869 transitions. Second operand 3 states. [2019-09-08 12:08:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:44,346 INFO L93 Difference]: Finished difference Result 24419 states and 34235 transitions. [2019-09-08 12:08:44,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:08:44,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:08:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:44,357 INFO L225 Difference]: With dead ends: 24419 [2019-09-08 12:08:44,358 INFO L226 Difference]: Without dead ends: 11817 [2019-09-08 12:08:44,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11817 states. [2019-09-08 12:08:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11817 to 9007. [2019-09-08 12:08:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9007 states. [2019-09-08 12:08:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9007 states to 9007 states and 12448 transitions. [2019-09-08 12:08:50,046 INFO L78 Accepts]: Start accepts. Automaton has 9007 states and 12448 transitions. Word has length 120 [2019-09-08 12:08:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:08:50,046 INFO L475 AbstractCegarLoop]: Abstraction has 9007 states and 12448 transitions. [2019-09-08 12:08:50,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:08:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 9007 states and 12448 transitions. [2019-09-08 12:08:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:08:50,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:08:50,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:08:50,048 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:08:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:08:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash -686485906, now seen corresponding path program 1 times [2019-09-08 12:08:50,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:08:50,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:08:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:50,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:08:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:08:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:08:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:08:50,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:08:50,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:08:50,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:08:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:08:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:50,109 INFO L87 Difference]: Start difference. First operand 9007 states and 12448 transitions. Second operand 3 states. [2019-09-08 12:08:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:58,947 INFO L93 Difference]: Finished difference Result 23165 states and 32088 transitions. [2019-09-08 12:08:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:08:58,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:08:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:58,961 INFO L225 Difference]: With dead ends: 23165 [2019-09-08 12:08:58,962 INFO L226 Difference]: Without dead ends: 14283 [2019-09-08 12:08:58,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:08:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14283 states. [2019-09-08 12:09:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14283 to 13369. [2019-09-08 12:09:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13369 states. [2019-09-08 12:09:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 18483 transitions. [2019-09-08 12:09:07,539 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 18483 transitions. Word has length 121 [2019-09-08 12:09:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:07,539 INFO L475 AbstractCegarLoop]: Abstraction has 13369 states and 18483 transitions. [2019-09-08 12:09:07,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 18483 transitions. [2019-09-08 12:09:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:09:07,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:07,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:07,540 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash 470166097, now seen corresponding path program 1 times [2019-09-08 12:09:07,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:07,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:07,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:07,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:07,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:07,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:07,592 INFO L87 Difference]: Start difference. First operand 13369 states and 18483 transitions. Second operand 3 states. [2019-09-08 12:09:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:17,919 INFO L93 Difference]: Finished difference Result 29421 states and 40625 transitions. [2019-09-08 12:09:17,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:17,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:09:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:17,936 INFO L225 Difference]: With dead ends: 29421 [2019-09-08 12:09:17,936 INFO L226 Difference]: Without dead ends: 16177 [2019-09-08 12:09:17,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16177 states. [2019-09-08 12:09:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16177 to 15391. [2019-09-08 12:09:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15391 states. [2019-09-08 12:09:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15391 states to 15391 states and 21105 transitions. [2019-09-08 12:09:28,184 INFO L78 Accepts]: Start accepts. Automaton has 15391 states and 21105 transitions. Word has length 122 [2019-09-08 12:09:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:28,184 INFO L475 AbstractCegarLoop]: Abstraction has 15391 states and 21105 transitions. [2019-09-08 12:09:28,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 15391 states and 21105 transitions. [2019-09-08 12:09:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:09:28,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:28,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:28,185 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:28,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1737959858, now seen corresponding path program 1 times [2019-09-08 12:09:28,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:28,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:28,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:28,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:28,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:28,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:09:28,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:09:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:09:28,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:28,236 INFO L87 Difference]: Start difference. First operand 15391 states and 21105 transitions. Second operand 3 states. [2019-09-08 12:09:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:09:39,192 INFO L93 Difference]: Finished difference Result 31539 states and 43251 transitions. [2019-09-08 12:09:39,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:09:39,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 12:09:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:09:39,210 INFO L225 Difference]: With dead ends: 31539 [2019-09-08 12:09:39,210 INFO L226 Difference]: Without dead ends: 16273 [2019-09-08 12:09:39,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:09:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16273 states. [2019-09-08 12:09:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16273 to 15951. [2019-09-08 12:09:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15951 states. [2019-09-08 12:09:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15951 states to 15951 states and 21681 transitions. [2019-09-08 12:09:49,803 INFO L78 Accepts]: Start accepts. Automaton has 15951 states and 21681 transitions. Word has length 123 [2019-09-08 12:09:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:49,803 INFO L475 AbstractCegarLoop]: Abstraction has 15951 states and 21681 transitions. [2019-09-08 12:09:49,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:09:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 15951 states and 21681 transitions. [2019-09-08 12:09:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:09:49,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:49,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:09:49,807 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1630138217, now seen corresponding path program 1 times [2019-09-08 12:09:49,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:49,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:49,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:09:49,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:09:49,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:09:49,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:50,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:09:50,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:09:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 12:09:50,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:09:50,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:09:50,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:09:50,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:09:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:09:50,351 INFO L87 Difference]: Start difference. First operand 15951 states and 21681 transitions. Second operand 11 states. [2019-09-08 12:11:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:11:22,759 INFO L93 Difference]: Finished difference Result 152589 states and 206780 transitions. [2019-09-08 12:11:22,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:11:22,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-08 12:11:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:11:23,104 INFO L225 Difference]: With dead ends: 152589 [2019-09-08 12:11:23,105 INFO L226 Difference]: Without dead ends: 136763 [2019-09-08 12:11:23,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:11:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136763 states. [2019-09-08 12:11:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136763 to 26047. [2019-09-08 12:11:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26047 states. [2019-09-08 12:11:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26047 states to 26047 states and 35249 transitions. [2019-09-08 12:11:44,612 INFO L78 Accepts]: Start accepts. Automaton has 26047 states and 35249 transitions. Word has length 151 [2019-09-08 12:11:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:11:44,612 INFO L475 AbstractCegarLoop]: Abstraction has 26047 states and 35249 transitions. [2019-09-08 12:11:44,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:11:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26047 states and 35249 transitions. [2019-09-08 12:11:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:11:44,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:11:44,619 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:11:44,619 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:11:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:11:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash 245011095, now seen corresponding path program 1 times [2019-09-08 12:11:44,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:11:44,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:11:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:44,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:11:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:11:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:11:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 12:11:44,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:11:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:11:44,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:11:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:11:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:11:44,825 INFO L87 Difference]: Start difference. First operand 26047 states and 35249 transitions. Second operand 7 states. [2019-09-08 12:13:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:13:08,706 INFO L93 Difference]: Finished difference Result 145299 states and 196543 transitions. [2019-09-08 12:13:08,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:13:08,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-08 12:13:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:13:08,939 INFO L225 Difference]: With dead ends: 145299 [2019-09-08 12:13:08,939 INFO L226 Difference]: Without dead ends: 119377 [2019-09-08 12:13:09,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:13:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119377 states. [2019-09-08 12:13:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119377 to 36143. [2019-09-08 12:13:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36143 states. [2019-09-08 12:13:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36143 states to 36143 states and 48817 transitions. [2019-09-08 12:13:35,205 INFO L78 Accepts]: Start accepts. Automaton has 36143 states and 48817 transitions. Word has length 151 [2019-09-08 12:13:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:13:35,205 INFO L475 AbstractCegarLoop]: Abstraction has 36143 states and 48817 transitions. [2019-09-08 12:13:35,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:13:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 36143 states and 48817 transitions. [2019-09-08 12:13:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:13:35,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:13:35,210 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:13:35,210 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:13:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:13:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash 609096855, now seen corresponding path program 1 times [2019-09-08 12:13:35,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:13:35,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:13:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:35,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:13:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:13:35,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:13:35,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:13:35,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:13:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:13:35,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:13:35,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:13:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:13:35,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:13:35,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:13:35,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:13:35,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:13:35,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:13:35,713 INFO L87 Difference]: Start difference. First operand 36143 states and 48817 transitions. Second operand 11 states. [2019-09-08 12:16:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:16:05,202 INFO L93 Difference]: Finished difference Result 232997 states and 315228 transitions. [2019-09-08 12:16:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:16:05,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-08 12:16:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:16:05,561 INFO L225 Difference]: With dead ends: 232997 [2019-09-08 12:16:05,561 INFO L226 Difference]: Without dead ends: 207075 [2019-09-08 12:16:05,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:16:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207075 states. [2019-09-08 12:16:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207075 to 52563. [2019-09-08 12:16:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52563 states. [2019-09-08 12:16:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52563 states to 52563 states and 70985 transitions. [2019-09-08 12:16:45,700 INFO L78 Accepts]: Start accepts. Automaton has 52563 states and 70985 transitions. Word has length 151 [2019-09-08 12:16:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:16:45,701 INFO L475 AbstractCegarLoop]: Abstraction has 52563 states and 70985 transitions. [2019-09-08 12:16:45,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:16:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 52563 states and 70985 transitions. [2019-09-08 12:16:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:16:45,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:16:45,706 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:16:45,706 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:16:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:16:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1349555863, now seen corresponding path program 1 times [2019-09-08 12:16:45,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:16:45,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:16:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:16:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:16:45,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:16:45,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:16:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:16:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:16:46,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:16:46,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:16:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:16:46,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:16:46,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 12:16:46,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:16:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:16:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:16:46,211 INFO L87 Difference]: Start difference. First operand 52563 states and 70985 transitions. Second operand 11 states.