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.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:42:22,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:42:22,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:42:22,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:42:22,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:42:22,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:42:22,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:42:22,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:42:22,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:42:22,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:42:22,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:42:22,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:42:22,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:42:22,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:42:22,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:42:22,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:42:22,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:42:22,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:42:22,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:42:22,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:42:22,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:42:22,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:42:22,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:42:22,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:42:22,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:42:22,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:42:22,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:42:22,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:42:22,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:42:22,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:42:22,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:42:22,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:42:22,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:42:22,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:42:22,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:42:22,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:42:22,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:42:22,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:42:22,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:42:22,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:42:22,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:42:22,421 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 11:42:22,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:42:22,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:42:22,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:42:22,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:42:22,437 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:42:22,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:42:22,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:42:22,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:42:22,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:42:22,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:42:22,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:42:22,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:42:22,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:42:22,438 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:42:22,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:42:22,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:42:22,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:42:22,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:42:22,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:42:22,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:42:22,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:42:22,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:42:22,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:42:22,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:42:22,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:42:22,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:42:22,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:42:22,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:42:22,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:42:22,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:42:22,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:42:22,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:42:22,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:42:22,491 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:42:22,492 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 11:42:22,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e485aaad9/55b5cca4b110473f9fabbfe849fb7021/FLAGa3506685f [2019-09-08 11:42:23,151 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:42:23,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 11:42:23,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e485aaad9/55b5cca4b110473f9fabbfe849fb7021/FLAGa3506685f [2019-09-08 11:42:23,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e485aaad9/55b5cca4b110473f9fabbfe849fb7021 [2019-09-08 11:42:23,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:42:23,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:42:23,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:42:23,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:42:23,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:42:23,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:42:23" (1/1) ... [2019-09-08 11:42:23,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c490221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:23, skipping insertion in model container [2019-09-08 11:42:23,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:42:23" (1/1) ... [2019-09-08 11:42:23,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:42:23,516 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:42:24,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:42:24,178 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:42:24,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:42:24,574 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:42:24,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24 WrapperNode [2019-09-08 11:42:24,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:42:24,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:42:24,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:42:24,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:42:24,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (1/1) ... [2019-09-08 11:42:24,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (1/1) ... [2019-09-08 11:42:24,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (1/1) ... [2019-09-08 11:42:24,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (1/1) ... [2019-09-08 11:42:24,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (1/1) ... [2019-09-08 11:42:24,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (1/1) ... [2019-09-08 11:42:24,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (1/1) ... [2019-09-08 11:42:24,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:42:24,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:42:24,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:42:24,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:42:24,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (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 11:42:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:42:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:42:24,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:42:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:42:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:42:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:42:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:42:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:42:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:42:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:42:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:42:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:42:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:42:24,760 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:42:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:42:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:42:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:42:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:42:24,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:42:26,261 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:42:26,262 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:42:26,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:42:26 BoogieIcfgContainer [2019-09-08 11:42:26,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:42:26,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:42:26,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:42:26,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:42:26,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:42:23" (1/3) ... [2019-09-08 11:42:26,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6d4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:42:26, skipping insertion in model container [2019-09-08 11:42:26,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:42:24" (2/3) ... [2019-09-08 11:42:26,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6d4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:42:26, skipping insertion in model container [2019-09-08 11:42:26,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:42:26" (3/3) ... [2019-09-08 11:42:26,278 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 11:42:26,290 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:42:26,316 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-08 11:42:26,338 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-08 11:42:26,385 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:42:26,386 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:42:26,387 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:42:26,387 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:42:26,387 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:42:26,387 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:42:26,387 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:42:26,388 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:42:26,388 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:42:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states. [2019-09-08 11:42:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:42:26,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:26,463 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] [2019-09-08 11:42:26,465 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2051434743, now seen corresponding path program 1 times [2019-09-08 11:42:26,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:26,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:26,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:26,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:27,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 11:42:27,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:27,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:42:27,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:42:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:42:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:42:27,099 INFO L87 Difference]: Start difference. First operand 363 states. Second operand 5 states. [2019-09-08 11:42:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:27,745 INFO L93 Difference]: Finished difference Result 712 states and 1199 transitions. [2019-09-08 11:42:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:42:27,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 11:42:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:27,764 INFO L225 Difference]: With dead ends: 712 [2019-09-08 11:42:27,764 INFO L226 Difference]: Without dead ends: 432 [2019-09-08 11:42:27,770 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 11:42:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-08 11:42:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 390. [2019-09-08 11:42:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-08 11:42:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 512 transitions. [2019-09-08 11:42:27,847 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 512 transitions. Word has length 63 [2019-09-08 11:42:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:27,848 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 512 transitions. [2019-09-08 11:42:27,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:42:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 512 transitions. [2019-09-08 11:42:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:42:27,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:27,851 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] [2019-09-08 11:42:27,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:27,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:27,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1195165915, now seen corresponding path program 1 times [2019-09-08 11:42:27,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:27,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:27,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:27,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:28,054 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 11:42:28,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:28,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:42:28,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:42:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:42:28,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:42:28,058 INFO L87 Difference]: Start difference. First operand 390 states and 512 transitions. Second operand 5 states. [2019-09-08 11:42:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:28,367 INFO L93 Difference]: Finished difference Result 685 states and 922 transitions. [2019-09-08 11:42:28,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:42:28,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:42:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:28,371 INFO L225 Difference]: With dead ends: 685 [2019-09-08 11:42:28,371 INFO L226 Difference]: Without dead ends: 364 [2019-09-08 11:42:28,374 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 11:42:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-09-08 11:42:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2019-09-08 11:42:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-08 11:42:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2019-09-08 11:42:28,416 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 64 [2019-09-08 11:42:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:28,418 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2019-09-08 11:42:28,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:42:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2019-09-08 11:42:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:42:28,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:28,420 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] [2019-09-08 11:42:28,421 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash -477481019, now seen corresponding path program 1 times [2019-09-08 11:42:28,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:28,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:28,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:28,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:28,593 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 11:42:28,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:28,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:42:28,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:42:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:42:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:42:28,595 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand 6 states. [2019-09-08 11:42:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:28,866 INFO L93 Difference]: Finished difference Result 822 states and 1100 transitions. [2019-09-08 11:42:28,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:42:28,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-08 11:42:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:28,870 INFO L225 Difference]: With dead ends: 822 [2019-09-08 11:42:28,871 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 11:42:28,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:42:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 11:42:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 477. [2019-09-08 11:42:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-08 11:42:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 645 transitions. [2019-09-08 11:42:28,903 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 645 transitions. Word has length 65 [2019-09-08 11:42:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:28,903 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 645 transitions. [2019-09-08 11:42:28,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:42:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 645 transitions. [2019-09-08 11:42:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:42:28,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:28,905 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] [2019-09-08 11:42:28,905 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1802107193, now seen corresponding path program 1 times [2019-09-08 11:42:28,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:28,992 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 11:42:28,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:28,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:42:28,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:42:28,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:42:28,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:42:28,993 INFO L87 Difference]: Start difference. First operand 477 states and 645 transitions. Second operand 5 states. [2019-09-08 11:42:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:29,258 INFO L93 Difference]: Finished difference Result 895 states and 1230 transitions. [2019-09-08 11:42:29,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:42:29,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 11:42:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:29,262 INFO L225 Difference]: With dead ends: 895 [2019-09-08 11:42:29,262 INFO L226 Difference]: Without dead ends: 466 [2019-09-08 11:42:29,263 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 11:42:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-08 11:42:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-09-08 11:42:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 629 transitions. [2019-09-08 11:42:29,290 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 629 transitions. Word has length 66 [2019-09-08 11:42:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:29,291 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 629 transitions. [2019-09-08 11:42:29,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:42:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 629 transitions. [2019-09-08 11:42:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:42:29,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:29,292 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] [2019-09-08 11:42:29,293 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash -350473883, now seen corresponding path program 1 times [2019-09-08 11:42:29,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:29,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:29,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:29,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:29,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:29,543 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 11:42:29,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:29,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:42:29,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:42:29,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:42:29,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:42:29,546 INFO L87 Difference]: Start difference. First operand 466 states and 629 transitions. Second operand 8 states. [2019-09-08 11:42:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:30,052 INFO L93 Difference]: Finished difference Result 1108 states and 1543 transitions. [2019-09-08 11:42:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:42:30,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-08 11:42:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:30,058 INFO L225 Difference]: With dead ends: 1108 [2019-09-08 11:42:30,058 INFO L226 Difference]: Without dead ends: 814 [2019-09-08 11:42:30,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:42:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-08 11:42:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 466. [2019-09-08 11:42:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 628 transitions. [2019-09-08 11:42:30,093 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 628 transitions. Word has length 67 [2019-09-08 11:42:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:30,093 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 628 transitions. [2019-09-08 11:42:30,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:42:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 628 transitions. [2019-09-08 11:42:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:42:30,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:30,095 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] [2019-09-08 11:42:30,096 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash 282133846, now seen corresponding path program 1 times [2019-09-08 11:42:30,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:30,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:30,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:30,341 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 11:42:30,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:30,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:30,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:30,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:30,344 INFO L87 Difference]: Start difference. First operand 466 states and 628 transitions. Second operand 9 states. [2019-09-08 11:42:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:31,589 INFO L93 Difference]: Finished difference Result 1253 states and 1791 transitions. [2019-09-08 11:42:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:42:31,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:42:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:31,596 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 11:42:31,596 INFO L226 Difference]: Without dead ends: 1007 [2019-09-08 11:42:31,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:42:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-08 11:42:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 466. [2019-09-08 11:42:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 627 transitions. [2019-09-08 11:42:31,639 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 627 transitions. Word has length 67 [2019-09-08 11:42:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:31,641 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 627 transitions. [2019-09-08 11:42:31,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 627 transitions. [2019-09-08 11:42:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:42:31,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:31,643 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] [2019-09-08 11:42:31,643 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:31,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1203066546, now seen corresponding path program 1 times [2019-09-08 11:42:31,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:31,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:31,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:31,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:31,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:31,822 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 11:42:31,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:31,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:31,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:31,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:31,824 INFO L87 Difference]: Start difference. First operand 466 states and 627 transitions. Second operand 9 states. [2019-09-08 11:42:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:32,970 INFO L93 Difference]: Finished difference Result 1445 states and 2054 transitions. [2019-09-08 11:42:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:42:32,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:42:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:32,980 INFO L225 Difference]: With dead ends: 1445 [2019-09-08 11:42:32,980 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 11:42:32,982 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 11:42:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 11:42:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 466. [2019-09-08 11:42:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 626 transitions. [2019-09-08 11:42:33,046 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 626 transitions. Word has length 67 [2019-09-08 11:42:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:33,048 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 626 transitions. [2019-09-08 11:42:33,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 626 transitions. [2019-09-08 11:42:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:42:33,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:33,055 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] [2019-09-08 11:42:33,056 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:33,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1166947524, now seen corresponding path program 1 times [2019-09-08 11:42:33,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:33,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:33,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:33,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:33,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:42:33,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:33,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:33,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:33,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:33,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:33,302 INFO L87 Difference]: Start difference. First operand 466 states and 626 transitions. Second operand 9 states. [2019-09-08 11:42:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:34,708 INFO L93 Difference]: Finished difference Result 1293 states and 1837 transitions. [2019-09-08 11:42:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:42:34,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:42:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:34,713 INFO L225 Difference]: With dead ends: 1293 [2019-09-08 11:42:34,713 INFO L226 Difference]: Without dead ends: 1007 [2019-09-08 11:42:34,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:42:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-08 11:42:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 466. [2019-09-08 11:42:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 624 transitions. [2019-09-08 11:42:34,769 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 624 transitions. Word has length 69 [2019-09-08 11:42:34,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:34,770 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 624 transitions. [2019-09-08 11:42:34,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 624 transitions. [2019-09-08 11:42:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:42:34,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:34,771 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] [2019-09-08 11:42:34,772 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:34,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:34,772 INFO L82 PathProgramCache]: Analyzing trace with hash 77892723, now seen corresponding path program 1 times [2019-09-08 11:42:34,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:34,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:34,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:34,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:34,919 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 11:42:34,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:34,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:34,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:34,921 INFO L87 Difference]: Start difference. First operand 466 states and 624 transitions. Second operand 9 states. [2019-09-08 11:42:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:36,011 INFO L93 Difference]: Finished difference Result 1206 states and 1688 transitions. [2019-09-08 11:42:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:42:36,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:42:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:36,018 INFO L225 Difference]: With dead ends: 1206 [2019-09-08 11:42:36,018 INFO L226 Difference]: Without dead ends: 1201 [2019-09-08 11:42:36,020 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 11:42:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-08 11:42:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-08 11:42:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 622 transitions. [2019-09-08 11:42:36,097 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 622 transitions. Word has length 69 [2019-09-08 11:42:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:36,097 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 622 transitions. [2019-09-08 11:42:36,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 622 transitions. [2019-09-08 11:42:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:42:36,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:36,099 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] [2019-09-08 11:42:36,099 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash -307155438, now seen corresponding path program 1 times [2019-09-08 11:42:36,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:36,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:36,229 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 11:42:36,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:36,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:36,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:36,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:36,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:36,231 INFO L87 Difference]: Start difference. First operand 466 states and 622 transitions. Second operand 9 states. [2019-09-08 11:42:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:37,374 INFO L93 Difference]: Finished difference Result 1242 states and 1740 transitions. [2019-09-08 11:42:37,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:42:37,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:42:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:37,383 INFO L225 Difference]: With dead ends: 1242 [2019-09-08 11:42:37,383 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 11:42:37,384 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 11:42:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 11:42:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 466. [2019-09-08 11:42:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 620 transitions. [2019-09-08 11:42:37,480 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 620 transitions. Word has length 69 [2019-09-08 11:42:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:37,480 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 620 transitions. [2019-09-08 11:42:37,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 620 transitions. [2019-09-08 11:42:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:42:37,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:37,482 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] [2019-09-08 11:42:37,482 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:37,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2116702936, now seen corresponding path program 1 times [2019-09-08 11:42:37,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:37,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:37,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:37,610 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 11:42:37,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:37,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:37,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:37,612 INFO L87 Difference]: Start difference. First operand 466 states and 620 transitions. Second operand 9 states. [2019-09-08 11:42:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:38,947 INFO L93 Difference]: Finished difference Result 1450 states and 2052 transitions. [2019-09-08 11:42:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:42:38,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:42:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:38,953 INFO L225 Difference]: With dead ends: 1450 [2019-09-08 11:42:38,953 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 11:42:38,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:42:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 11:42:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 466. [2019-09-08 11:42:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 619 transitions. [2019-09-08 11:42:39,008 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 619 transitions. Word has length 69 [2019-09-08 11:42:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:39,008 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 619 transitions. [2019-09-08 11:42:39,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 619 transitions. [2019-09-08 11:42:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:42:39,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:39,009 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] [2019-09-08 11:42:39,010 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:39,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:39,010 INFO L82 PathProgramCache]: Analyzing trace with hash 249107848, now seen corresponding path program 1 times [2019-09-08 11:42:39,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:39,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:39,146 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 11:42:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:39,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:39,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:39,149 INFO L87 Difference]: Start difference. First operand 466 states and 619 transitions. Second operand 9 states. [2019-09-08 11:42:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:40,015 INFO L93 Difference]: Finished difference Result 1414 states and 1997 transitions. [2019-09-08 11:42:40,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:42:40,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:42:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:40,021 INFO L225 Difference]: With dead ends: 1414 [2019-09-08 11:42:40,022 INFO L226 Difference]: Without dead ends: 1201 [2019-09-08 11:42:40,023 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 11:42:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-08 11:42:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-08 11:42:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 618 transitions. [2019-09-08 11:42:40,075 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 618 transitions. Word has length 69 [2019-09-08 11:42:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:40,075 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 618 transitions. [2019-09-08 11:42:40,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 618 transitions. [2019-09-08 11:42:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:42:40,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:40,077 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] [2019-09-08 11:42:40,077 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash -913030277, now seen corresponding path program 1 times [2019-09-08 11:42:40,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:40,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:40,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:40,211 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 11:42:40,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:40,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:40,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:40,213 INFO L87 Difference]: Start difference. First operand 466 states and 618 transitions. Second operand 9 states. [2019-09-08 11:42:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:41,335 INFO L93 Difference]: Finished difference Result 1206 states and 1682 transitions. [2019-09-08 11:42:41,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:42:41,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:42:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:41,341 INFO L225 Difference]: With dead ends: 1206 [2019-09-08 11:42:41,342 INFO L226 Difference]: Without dead ends: 1201 [2019-09-08 11:42:41,342 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 11:42:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-08 11:42:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-08 11:42:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 617 transitions. [2019-09-08 11:42:41,396 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 617 transitions. Word has length 69 [2019-09-08 11:42:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:41,397 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 617 transitions. [2019-09-08 11:42:41,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 617 transitions. [2019-09-08 11:42:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:42:41,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:41,398 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] [2019-09-08 11:42:41,398 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash 360843612, now seen corresponding path program 1 times [2019-09-08 11:42:41,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:41,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:41,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:41,535 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 11:42:41,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:41,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:42:41,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:42:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:42:41,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:42:41,537 INFO L87 Difference]: Start difference. First operand 466 states and 617 transitions. Second operand 9 states. [2019-09-08 11:42:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:42,476 INFO L93 Difference]: Finished difference Result 1411 states and 1991 transitions. [2019-09-08 11:42:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:42:42,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:42:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:42,482 INFO L225 Difference]: With dead ends: 1411 [2019-09-08 11:42:42,482 INFO L226 Difference]: Without dead ends: 1201 [2019-09-08 11:42:42,483 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 11:42:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-08 11:42:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 466. [2019-09-08 11:42:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-08 11:42:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 616 transitions. [2019-09-08 11:42:42,539 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 616 transitions. Word has length 69 [2019-09-08 11:42:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:42,539 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 616 transitions. [2019-09-08 11:42:42,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:42:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 616 transitions. [2019-09-08 11:42:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:42:42,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:42,541 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] [2019-09-08 11:42:42,541 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:42,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2098110889, now seen corresponding path program 1 times [2019-09-08 11:42:42,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:42,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:42,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:42,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:42,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:42:43,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:43,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:42:43,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:42:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:42:43,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:42:43,346 INFO L87 Difference]: Start difference. First operand 466 states and 616 transitions. Second operand 16 states. [2019-09-08 11:42:43,998 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:42:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:45,636 INFO L93 Difference]: Finished difference Result 1363 states and 1879 transitions. [2019-09-08 11:42:45,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:42:45,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-08 11:42:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:45,643 INFO L225 Difference]: With dead ends: 1363 [2019-09-08 11:42:45,643 INFO L226 Difference]: Without dead ends: 1154 [2019-09-08 11:42:45,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:42:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-09-08 11:42:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 465. [2019-09-08 11:42:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:42:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 614 transitions. [2019-09-08 11:42:45,720 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 614 transitions. Word has length 71 [2019-09-08 11:42:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:45,720 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 614 transitions. [2019-09-08 11:42:45,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:42:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 614 transitions. [2019-09-08 11:42:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:42:45,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:45,722 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] [2019-09-08 11:42:45,722 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1752408440, now seen corresponding path program 1 times [2019-09-08 11:42:45,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:45,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:45,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:46,957 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 11:42:46,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:46,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:42:46,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:42:46,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:42:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:42:46,959 INFO L87 Difference]: Start difference. First operand 465 states and 614 transitions. Second operand 21 states. [2019-09-08 11:42:47,092 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 11:42:47,694 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 11:42:47,836 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:42:48,001 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:42:48,237 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 11:42:48,548 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-08 11:42:48,738 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:42:48,914 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:42:49,086 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 11:42:49,360 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:42:49,610 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 11:42:49,807 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:42:50,082 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:42:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:51,805 INFO L93 Difference]: Finished difference Result 964 states and 1287 transitions. [2019-09-08 11:42:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:42:51,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-08 11:42:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:51,812 INFO L225 Difference]: With dead ends: 964 [2019-09-08 11:42:51,812 INFO L226 Difference]: Without dead ends: 958 [2019-09-08 11:42:51,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 11:42:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-09-08 11:42:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 465. [2019-09-08 11:42:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:42:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 613 transitions. [2019-09-08 11:42:51,899 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 613 transitions. Word has length 71 [2019-09-08 11:42:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:51,899 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 613 transitions. [2019-09-08 11:42:51,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:42:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 613 transitions. [2019-09-08 11:42:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:42:51,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:51,901 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] [2019-09-08 11:42:51,901 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash 841585007, now seen corresponding path program 1 times [2019-09-08 11:42:51,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:51,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:52,604 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 11:42:52,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:52,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:42:52,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:42:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:42:52,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:42:52,606 INFO L87 Difference]: Start difference. First operand 465 states and 613 transitions. Second operand 17 states. [2019-09-08 11:42:53,173 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:42:53,316 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 11:42:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:54,059 INFO L93 Difference]: Finished difference Result 841 states and 1153 transitions. [2019-09-08 11:42:54,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:42:54,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-08 11:42:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:54,062 INFO L225 Difference]: With dead ends: 841 [2019-09-08 11:42:54,062 INFO L226 Difference]: Without dead ends: 600 [2019-09-08 11:42:54,063 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 11:42:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-08 11:42:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 446. [2019-09-08 11:42:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-08 11:42:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 589 transitions. [2019-09-08 11:42:54,143 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 589 transitions. Word has length 71 [2019-09-08 11:42:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:54,143 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 589 transitions. [2019-09-08 11:42:54,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:42:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 589 transitions. [2019-09-08 11:42:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:42:54,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:54,144 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] [2019-09-08 11:42:54,145 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:54,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash 176129943, now seen corresponding path program 1 times [2019-09-08 11:42:54,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:54,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:54,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:54,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:54,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:55,384 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 11:42:55,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:55,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:42:55,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:42:55,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:42:55,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:42:55,386 INFO L87 Difference]: Start difference. First operand 446 states and 589 transitions. Second operand 21 states. [2019-09-08 11:42:55,516 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 11:42:56,267 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:42:56,459 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-08 11:42:56,740 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 11:42:56,927 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:42:57,105 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:42:57,312 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:42:57,926 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 11:42:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:42:59,081 INFO L93 Difference]: Finished difference Result 1018 states and 1398 transitions. [2019-09-08 11:42:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:42:59,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-08 11:42:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:42:59,085 INFO L225 Difference]: With dead ends: 1018 [2019-09-08 11:42:59,085 INFO L226 Difference]: Without dead ends: 806 [2019-09-08 11:42:59,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:42:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-09-08 11:42:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 456. [2019-09-08 11:42:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-08 11:42:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 604 transitions. [2019-09-08 11:42:59,168 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 604 transitions. Word has length 71 [2019-09-08 11:42:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:42:59,169 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 604 transitions. [2019-09-08 11:42:59,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:42:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 604 transitions. [2019-09-08 11:42:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:42:59,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:42:59,170 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] [2019-09-08 11:42:59,171 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:42:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:42:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2101080436, now seen corresponding path program 1 times [2019-09-08 11:42:59,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:42:59,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:42:59,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:42:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:42:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:42:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:42:59,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:42:59,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:42:59,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:42:59,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:42:59,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:42:59,730 INFO L87 Difference]: Start difference. First operand 456 states and 604 transitions. Second operand 14 states. [2019-09-08 11:43:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:01,177 INFO L93 Difference]: Finished difference Result 975 states and 1363 transitions. [2019-09-08 11:43:01,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:43:01,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-08 11:43:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:01,181 INFO L225 Difference]: With dead ends: 975 [2019-09-08 11:43:01,181 INFO L226 Difference]: Without dead ends: 701 [2019-09-08 11:43:01,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:43:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-09-08 11:43:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 429. [2019-09-08 11:43:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-08 11:43:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 570 transitions. [2019-09-08 11:43:01,260 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 570 transitions. Word has length 71 [2019-09-08 11:43:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:01,260 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 570 transitions. [2019-09-08 11:43:01,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:43:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 570 transitions. [2019-09-08 11:43:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:43:01,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:01,261 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] [2019-09-08 11:43:01,262 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1738970789, now seen corresponding path program 1 times [2019-09-08 11:43:01,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:01,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:01,636 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 11:43:01,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:01,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:43:01,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:43:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:43:01,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:43:01,638 INFO L87 Difference]: Start difference. First operand 429 states and 570 transitions. Second operand 11 states. [2019-09-08 11:43:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:02,728 INFO L93 Difference]: Finished difference Result 2445 states and 3549 transitions. [2019-09-08 11:43:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:43:02,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-08 11:43:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:02,736 INFO L225 Difference]: With dead ends: 2445 [2019-09-08 11:43:02,736 INFO L226 Difference]: Without dead ends: 2211 [2019-09-08 11:43:02,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:43:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-09-08 11:43:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 397. [2019-09-08 11:43:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 11:43:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 525 transitions. [2019-09-08 11:43:02,806 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 525 transitions. Word has length 72 [2019-09-08 11:43:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:02,807 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 525 transitions. [2019-09-08 11:43:02,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:43:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 525 transitions. [2019-09-08 11:43:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:43:02,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:02,808 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] [2019-09-08 11:43:02,808 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:02,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1749461620, now seen corresponding path program 1 times [2019-09-08 11:43:02,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:02,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:02,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:03,222 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 11:43:03,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:03,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:43:03,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:43:03,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:43:03,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:43:03,223 INFO L87 Difference]: Start difference. First operand 397 states and 525 transitions. Second operand 13 states. [2019-09-08 11:43:03,833 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-08 11:43:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:04,624 INFO L93 Difference]: Finished difference Result 1497 states and 2156 transitions. [2019-09-08 11:43:04,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:43:04,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-08 11:43:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:04,630 INFO L225 Difference]: With dead ends: 1497 [2019-09-08 11:43:04,630 INFO L226 Difference]: Without dead ends: 1475 [2019-09-08 11:43:04,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:43:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-09-08 11:43:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 375. [2019-09-08 11:43:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 11:43:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 500 transitions. [2019-09-08 11:43:04,713 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 500 transitions. Word has length 72 [2019-09-08 11:43:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:04,714 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 500 transitions. [2019-09-08 11:43:04,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:43:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 500 transitions. [2019-09-08 11:43:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:43:04,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:04,715 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] [2019-09-08 11:43:04,716 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:04,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:04,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1380903087, now seen corresponding path program 1 times [2019-09-08 11:43:04,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:04,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:04,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:04,830 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 11:43:04,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:04,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:43:04,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:43:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:43:04,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:43:04,833 INFO L87 Difference]: Start difference. First operand 375 states and 500 transitions. Second operand 9 states. [2019-09-08 11:43:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:05,660 INFO L93 Difference]: Finished difference Result 1325 states and 1884 transitions. [2019-09-08 11:43:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:43:05,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 11:43:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:05,665 INFO L225 Difference]: With dead ends: 1325 [2019-09-08 11:43:05,665 INFO L226 Difference]: Without dead ends: 1073 [2019-09-08 11:43:05,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:43:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-09-08 11:43:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 375. [2019-09-08 11:43:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 11:43:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2019-09-08 11:43:05,776 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 72 [2019-09-08 11:43:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:05,776 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2019-09-08 11:43:05,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:43:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2019-09-08 11:43:05,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:43:05,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:05,778 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] [2019-09-08 11:43:05,778 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1779169883, now seen corresponding path program 1 times [2019-09-08 11:43:05,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:05,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:05,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:05,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:05,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:06,058 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 11:43:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:43:06,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:43:06,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:43:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:43:06,059 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 11 states. [2019-09-08 11:43:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:07,014 INFO L93 Difference]: Finished difference Result 2323 states and 3400 transitions. [2019-09-08 11:43:07,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:43:07,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-08 11:43:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:07,021 INFO L225 Difference]: With dead ends: 2323 [2019-09-08 11:43:07,021 INFO L226 Difference]: Without dead ends: 2100 [2019-09-08 11:43:07,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:43:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-09-08 11:43:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 360. [2019-09-08 11:43:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-08 11:43:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 479 transitions. [2019-09-08 11:43:07,099 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 479 transitions. Word has length 72 [2019-09-08 11:43:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:07,099 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 479 transitions. [2019-09-08 11:43:07,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:43:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 479 transitions. [2019-09-08 11:43:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:43:07,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:07,100 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] [2019-09-08 11:43:07,101 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:07,101 INFO L82 PathProgramCache]: Analyzing trace with hash 949044476, now seen corresponding path program 1 times [2019-09-08 11:43:07,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:07,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:07,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:07,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:07,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:07,475 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 11:43:07,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:07,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:43:07,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:43:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:43:07,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:43:07,477 INFO L87 Difference]: Start difference. First operand 360 states and 479 transitions. Second operand 12 states. [2019-09-08 11:43:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:08,552 INFO L93 Difference]: Finished difference Result 852 states and 1186 transitions. [2019-09-08 11:43:08,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:43:08,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-08 11:43:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:08,554 INFO L225 Difference]: With dead ends: 852 [2019-09-08 11:43:08,554 INFO L226 Difference]: Without dead ends: 640 [2019-09-08 11:43:08,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:43:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-08 11:43:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 356. [2019-09-08 11:43:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-08 11:43:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 474 transitions. [2019-09-08 11:43:08,630 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 474 transitions. Word has length 72 [2019-09-08 11:43:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:08,630 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 474 transitions. [2019-09-08 11:43:08,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:43:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 474 transitions. [2019-09-08 11:43:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:43:08,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:08,631 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] [2019-09-08 11:43:08,632 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1698523617, now seen corresponding path program 1 times [2019-09-08 11:43:08,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:08,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:08,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:08,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:08,750 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 11:43:08,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:08,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:43:08,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:43:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:43:08,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:43:08,751 INFO L87 Difference]: Start difference. First operand 356 states and 474 transitions. Second operand 9 states. [2019-09-08 11:43:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:09,515 INFO L93 Difference]: Finished difference Result 639 states and 867 transitions. [2019-09-08 11:43:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:43:09,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 11:43:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:09,518 INFO L225 Difference]: With dead ends: 639 [2019-09-08 11:43:09,518 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 11:43:09,519 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 11:43:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 11:43:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 356. [2019-09-08 11:43:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-08 11:43:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 473 transitions. [2019-09-08 11:43:09,592 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 473 transitions. Word has length 73 [2019-09-08 11:43:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:09,592 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 473 transitions. [2019-09-08 11:43:09,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:43:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 473 transitions. [2019-09-08 11:43:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:43:09,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:09,593 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] [2019-09-08 11:43:09,593 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1821871537, now seen corresponding path program 1 times [2019-09-08 11:43:09,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:09,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:09,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:09,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:09,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43: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 11:43:10,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:10,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:43:10,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:43:10,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:43:10,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:43:10,658 INFO L87 Difference]: Start difference. First operand 356 states and 473 transitions. Second operand 21 states. [2019-09-08 11:43:10,787 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-08 11:43:11,214 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 11:43:11,351 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-08 11:43:11,534 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 11:43:11,710 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:43:11,919 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-08 11:43:12,104 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-08 11:43:12,297 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-08 11:43:12,570 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:43:13,051 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 11:43:14,533 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 11:43:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:15,228 INFO L93 Difference]: Finished difference Result 2136 states and 3103 transitions. [2019-09-08 11:43:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:43:15,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-09-08 11:43:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:15,237 INFO L225 Difference]: With dead ends: 2136 [2019-09-08 11:43:15,238 INFO L226 Difference]: Without dead ends: 2130 [2019-09-08 11:43:15,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:43:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-09-08 11:43:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 368. [2019-09-08 11:43:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-08 11:43:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 488 transitions. [2019-09-08 11:43:15,333 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 488 transitions. Word has length 74 [2019-09-08 11:43:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:15,333 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 488 transitions. [2019-09-08 11:43:15,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:43:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 488 transitions. [2019-09-08 11:43:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:43:15,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:15,334 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] [2019-09-08 11:43:15,334 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash -242218485, now seen corresponding path program 1 times [2019-09-08 11:43:15,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:15,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:15,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:15,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:15,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:15,988 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 11:43:15,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:15,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:43:15,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:43:15,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:43:15,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:43:15,989 INFO L87 Difference]: Start difference. First operand 368 states and 488 transitions. Second operand 16 states. [2019-09-08 11:43:16,615 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:43:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:18,604 INFO L93 Difference]: Finished difference Result 1816 states and 2622 transitions. [2019-09-08 11:43:18,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:43:18,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-09-08 11:43:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:18,610 INFO L225 Difference]: With dead ends: 1816 [2019-09-08 11:43:18,610 INFO L226 Difference]: Without dead ends: 1810 [2019-09-08 11:43:18,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:43:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-09-08 11:43:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 356. [2019-09-08 11:43:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-08 11:43:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 472 transitions. [2019-09-08 11:43:18,724 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 472 transitions. Word has length 75 [2019-09-08 11:43:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:18,725 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 472 transitions. [2019-09-08 11:43:18,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:43:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 472 transitions. [2019-09-08 11:43:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:43:18,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:18,726 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] [2019-09-08 11:43:18,726 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash 322835229, now seen corresponding path program 1 times [2019-09-08 11:43:18,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:18,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:18,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:19,068 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 11:43:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:43:19,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:43:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:43:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:43:19,069 INFO L87 Difference]: Start difference. First operand 356 states and 472 transitions. Second operand 12 states. [2019-09-08 11:43:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:20,378 INFO L93 Difference]: Finished difference Result 1058 states and 1494 transitions. [2019-09-08 11:43:20,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:43:20,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-08 11:43:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:20,381 INFO L225 Difference]: With dead ends: 1058 [2019-09-08 11:43:20,382 INFO L226 Difference]: Without dead ends: 1052 [2019-09-08 11:43:20,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:43:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-09-08 11:43:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 350. [2019-09-08 11:43:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-08 11:43:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 466 transitions. [2019-09-08 11:43:20,467 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 466 transitions. Word has length 75 [2019-09-08 11:43:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:20,467 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 466 transitions. [2019-09-08 11:43:20,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:43:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 466 transitions. [2019-09-08 11:43:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:43:20,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:20,468 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] [2019-09-08 11:43:20,468 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:20,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1485666102, now seen corresponding path program 1 times [2019-09-08 11:43:20,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:20,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:20,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:20,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:21,778 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 11:43:21,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:21,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 11:43:21,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 11:43:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 11:43:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:43:21,779 INFO L87 Difference]: Start difference. First operand 350 states and 466 transitions. Second operand 23 states. [2019-09-08 11:43:22,792 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 11:43:23,018 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:43:23,176 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 11:43:23,335 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 11:43:23,493 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:43:23,647 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 11:43:23,787 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:43:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:25,324 INFO L93 Difference]: Finished difference Result 796 states and 1120 transitions. [2019-09-08 11:43:25,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:43:25,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-09-08 11:43:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:25,326 INFO L225 Difference]: With dead ends: 796 [2019-09-08 11:43:25,326 INFO L226 Difference]: Without dead ends: 788 [2019-09-08 11:43:25,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:43:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-08 11:43:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 355. [2019-09-08 11:43:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-08 11:43:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 471 transitions. [2019-09-08 11:43:25,418 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 471 transitions. Word has length 75 [2019-09-08 11:43:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:25,418 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 471 transitions. [2019-09-08 11:43:25,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 11:43:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 471 transitions. [2019-09-08 11:43:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:43:25,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:25,420 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 11:43:25,420 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash -333093647, now seen corresponding path program 1 times [2019-09-08 11:43:25,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:25,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:26,778 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 11:43:26,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:26,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:43:26,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:43:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:43:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:43:26,779 INFO L87 Difference]: Start difference. First operand 355 states and 471 transitions. Second operand 21 states. [2019-09-08 11:43:27,030 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 11:43:27,309 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-08 11:43:27,441 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-08 11:43:27,752 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:43:28,000 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 11:43:28,263 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 11:43:28,591 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 11:43:28,893 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:43:29,226 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 11:43:29,586 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 11:43:29,897 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 11:43:30,286 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-08 11:43:30,562 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 11:43:30,870 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:43:31,169 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 11:43:31,448 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 11:43:31,745 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 11:43:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:32,165 INFO L93 Difference]: Finished difference Result 364 states and 479 transitions. [2019-09-08 11:43:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:43:32,169 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-08 11:43:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:32,170 INFO L225 Difference]: With dead ends: 364 [2019-09-08 11:43:32,170 INFO L226 Difference]: Without dead ends: 349 [2019-09-08 11:43:32,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:43:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-08 11:43:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-09-08 11:43:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-08 11:43:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 463 transitions. [2019-09-08 11:43:32,271 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 463 transitions. Word has length 76 [2019-09-08 11:43:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:32,271 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 463 transitions. [2019-09-08 11:43:32,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:43:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 463 transitions. [2019-09-08 11:43:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:43:32,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:32,272 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 11:43:32,272 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:32,273 INFO L82 PathProgramCache]: Analyzing trace with hash 936148827, now seen corresponding path program 1 times [2019-09-08 11:43:32,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:32,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:32,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:32,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:32,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:32,826 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 11:43:32,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:32,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:43:32,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:43:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:43:32,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:43:32,828 INFO L87 Difference]: Start difference. First operand 349 states and 463 transitions. Second operand 15 states. [2019-09-08 11:43:33,722 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 11:43:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:34,321 INFO L93 Difference]: Finished difference Result 703 states and 978 transitions. [2019-09-08 11:43:34,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:43:34,322 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-09-08 11:43:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:34,323 INFO L225 Difference]: With dead ends: 703 [2019-09-08 11:43:34,323 INFO L226 Difference]: Without dead ends: 680 [2019-09-08 11:43:34,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:43:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-08 11:43:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 326. [2019-09-08 11:43:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-08 11:43:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 440 transitions. [2019-09-08 11:43:34,407 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 440 transitions. Word has length 76 [2019-09-08 11:43:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:34,407 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 440 transitions. [2019-09-08 11:43:34,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:43:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 440 transitions. [2019-09-08 11:43:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:43:34,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:34,409 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] [2019-09-08 11:43:34,409 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -785407461, now seen corresponding path program 1 times [2019-09-08 11:43:34,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:34,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:34,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:34,470 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 11:43:34,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:34,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:43:34,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:43:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:43:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:43:34,471 INFO L87 Difference]: Start difference. First operand 326 states and 440 transitions. Second operand 3 states. [2019-09-08 11:43:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:34,826 INFO L93 Difference]: Finished difference Result 726 states and 1034 transitions. [2019-09-08 11:43:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:43:34,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 11:43:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:34,829 INFO L225 Difference]: With dead ends: 726 [2019-09-08 11:43:34,829 INFO L226 Difference]: Without dead ends: 518 [2019-09-08 11:43:34,830 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 11:43:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-08 11:43:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2019-09-08 11:43:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-08 11:43:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 716 transitions. [2019-09-08 11:43:35,170 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 716 transitions. Word has length 97 [2019-09-08 11:43:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:35,170 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 716 transitions. [2019-09-08 11:43:35,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:43:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 716 transitions. [2019-09-08 11:43:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:43:35,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:35,173 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] [2019-09-08 11:43:35,173 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1930087174, now seen corresponding path program 1 times [2019-09-08 11:43:35,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:35,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:35,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:35,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:35,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:35,246 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 11:43:35,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:35,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:43:35,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:43:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:43:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:43:35,251 INFO L87 Difference]: Start difference. First operand 516 states and 716 transitions. Second operand 5 states. [2019-09-08 11:43:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:36,233 INFO L93 Difference]: Finished difference Result 2420 states and 3512 transitions. [2019-09-08 11:43:36,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:43:36,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:43:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:36,239 INFO L225 Difference]: With dead ends: 2420 [2019-09-08 11:43:36,239 INFO L226 Difference]: Without dead ends: 2022 [2019-09-08 11:43:36,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:43:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-09-08 11:43:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 952. [2019-09-08 11:43:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-09-08 11:43:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1344 transitions. [2019-09-08 11:43:36,781 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1344 transitions. Word has length 99 [2019-09-08 11:43:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:36,781 INFO L475 AbstractCegarLoop]: Abstraction has 952 states and 1344 transitions. [2019-09-08 11:43:36,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:43:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1344 transitions. [2019-09-08 11:43:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:43:36,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:36,784 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] [2019-09-08 11:43:36,785 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash -943241466, now seen corresponding path program 1 times [2019-09-08 11:43:36,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:36,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:36,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:36,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:36,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:36,855 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 11:43:36,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:36,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:43:36,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:43:36,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:43:36,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:43:36,857 INFO L87 Difference]: Start difference. First operand 952 states and 1344 transitions. Second operand 5 states. [2019-09-08 11:43:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:38,242 INFO L93 Difference]: Finished difference Result 4256 states and 6116 transitions. [2019-09-08 11:43:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:43:38,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:43:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:38,251 INFO L225 Difference]: With dead ends: 4256 [2019-09-08 11:43:38,251 INFO L226 Difference]: Without dead ends: 3422 [2019-09-08 11:43:38,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:43:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2019-09-08 11:43:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 1848. [2019-09-08 11:43:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-09-08 11:43:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2624 transitions. [2019-09-08 11:43:38,998 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2624 transitions. Word has length 99 [2019-09-08 11:43:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:38,999 INFO L475 AbstractCegarLoop]: Abstraction has 1848 states and 2624 transitions. [2019-09-08 11:43:38,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:43:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2624 transitions. [2019-09-08 11:43:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:43:39,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:39,000 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] [2019-09-08 11:43:39,001 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash 703943869, now seen corresponding path program 1 times [2019-09-08 11:43:39,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:39,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:39,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:39,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:39,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:39,061 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 11:43:39,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:39,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:43:39,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:43:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:43:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:43:39,062 INFO L87 Difference]: Start difference. First operand 1848 states and 2624 transitions. Second operand 3 states. [2019-09-08 11:43:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:40,058 INFO L93 Difference]: Finished difference Result 4476 states and 6426 transitions. [2019-09-08 11:43:40,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:43:40,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:43:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:40,062 INFO L225 Difference]: With dead ends: 4476 [2019-09-08 11:43:40,063 INFO L226 Difference]: Without dead ends: 2746 [2019-09-08 11:43:40,066 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 11:43:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2019-09-08 11:43:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2744. [2019-09-08 11:43:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-09-08 11:43:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3896 transitions. [2019-09-08 11:43:41,055 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3896 transitions. Word has length 99 [2019-09-08 11:43:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:41,056 INFO L475 AbstractCegarLoop]: Abstraction has 2744 states and 3896 transitions. [2019-09-08 11:43:41,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:43:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3896 transitions. [2019-09-08 11:43:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:43:41,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:41,059 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] [2019-09-08 11:43:41,059 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash -35796452, now seen corresponding path program 1 times [2019-09-08 11:43:41,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:41,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:41,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:41,117 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 11:43:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:41,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:43:41,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:43:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:43:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:43:41,119 INFO L87 Difference]: Start difference. First operand 2744 states and 3896 transitions. Second operand 3 states. [2019-09-08 11:43:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:42,687 INFO L93 Difference]: Finished difference Result 6700 states and 9510 transitions. [2019-09-08 11:43:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:43:42,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:43:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:42,693 INFO L225 Difference]: With dead ends: 6700 [2019-09-08 11:43:42,693 INFO L226 Difference]: Without dead ends: 4074 [2019-09-08 11:43:42,698 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 11:43:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4074 states. [2019-09-08 11:43:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4074 to 4072. [2019-09-08 11:43:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4072 states. [2019-09-08 11:43:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 5692 transitions. [2019-09-08 11:43:44,153 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 5692 transitions. Word has length 99 [2019-09-08 11:43:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:44,153 INFO L475 AbstractCegarLoop]: Abstraction has 4072 states and 5692 transitions. [2019-09-08 11:43:44,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:43:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 5692 transitions. [2019-09-08 11:43:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:43:44,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:44,155 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] [2019-09-08 11:43:44,156 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2062661056, now seen corresponding path program 1 times [2019-09-08 11:43:44,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:44,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:44,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:44,222 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 11:43:44,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:44,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:43:44,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:43:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:43:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:43:44,223 INFO L87 Difference]: Start difference. First operand 4072 states and 5692 transitions. Second operand 5 states. [2019-09-08 11:43:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:49,444 INFO L93 Difference]: Finished difference Result 17196 states and 24080 transitions. [2019-09-08 11:43:49,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:43:49,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:43:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:49,460 INFO L225 Difference]: With dead ends: 17196 [2019-09-08 11:43:49,461 INFO L226 Difference]: Without dead ends: 13242 [2019-09-08 11:43:49,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:43:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2019-09-08 11:43:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 8312. [2019-09-08 11:43:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8312 states. [2019-09-08 11:43:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8312 states to 8312 states and 11544 transitions. [2019-09-08 11:43:52,493 INFO L78 Accepts]: Start accepts. Automaton has 8312 states and 11544 transitions. Word has length 99 [2019-09-08 11:43:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:43:52,493 INFO L475 AbstractCegarLoop]: Abstraction has 8312 states and 11544 transitions. [2019-09-08 11:43:52,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:43:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8312 states and 11544 transitions. [2019-09-08 11:43:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:43:52,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:43:52,497 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] [2019-09-08 11:43:52,497 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:43:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:43:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1021442252, now seen corresponding path program 1 times [2019-09-08 11:43:52,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:43:52,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:43:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:43:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:43:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:43:52,553 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 11:43:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:43:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:43:52,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:43:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:43:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:43:52,555 INFO L87 Difference]: Start difference. First operand 8312 states and 11544 transitions. Second operand 5 states. [2019-09-08 11:43:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:43:59,493 INFO L93 Difference]: Finished difference Result 26096 states and 35932 transitions. [2019-09-08 11:43:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:43:59,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:43:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:43:59,511 INFO L225 Difference]: With dead ends: 26096 [2019-09-08 11:43:59,511 INFO L226 Difference]: Without dead ends: 17902 [2019-09-08 11:43:59,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:43:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17902 states. [2019-09-08 11:44:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17902 to 10320. [2019-09-08 11:44:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10320 states. [2019-09-08 11:44:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10320 states to 10320 states and 14040 transitions. [2019-09-08 11:44:04,035 INFO L78 Accepts]: Start accepts. Automaton has 10320 states and 14040 transitions. Word has length 99 [2019-09-08 11:44:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:04,035 INFO L475 AbstractCegarLoop]: Abstraction has 10320 states and 14040 transitions. [2019-09-08 11:44:04,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:44:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10320 states and 14040 transitions. [2019-09-08 11:44:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:44:04,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:04,038 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] [2019-09-08 11:44:04,038 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash 288255902, now seen corresponding path program 1 times [2019-09-08 11:44:04,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:04,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:04,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:04,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:04,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:44:04,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:04,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:44:04,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:44:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:44:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:44:04,123 INFO L87 Difference]: Start difference. First operand 10320 states and 14040 transitions. Second operand 6 states. [2019-09-08 11:44:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:10,734 INFO L93 Difference]: Finished difference Result 17036 states and 22869 transitions. [2019-09-08 11:44:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:44:10,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 11:44:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:10,750 INFO L225 Difference]: With dead ends: 17036 [2019-09-08 11:44:10,750 INFO L226 Difference]: Without dead ends: 17034 [2019-09-08 11:44:10,753 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 11:44:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17034 states. [2019-09-08 11:44:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17034 to 10512. [2019-09-08 11:44:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10512 states. [2019-09-08 11:44:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10512 states to 10512 states and 14168 transitions. [2019-09-08 11:44:14,734 INFO L78 Accepts]: Start accepts. Automaton has 10512 states and 14168 transitions. Word has length 100 [2019-09-08 11:44:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:14,735 INFO L475 AbstractCegarLoop]: Abstraction has 10512 states and 14168 transitions. [2019-09-08 11:44:14,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:44:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 10512 states and 14168 transitions. [2019-09-08 11:44:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:44:14,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:14,737 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] [2019-09-08 11:44:14,738 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash -693244254, now seen corresponding path program 1 times [2019-09-08 11:44:14,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:14,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:14,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:14,794 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 11:44:14,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:14,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:44:14,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:44:14,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:44:14,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:44:14,795 INFO L87 Difference]: Start difference. First operand 10512 states and 14168 transitions. Second operand 3 states. [2019-09-08 11:44:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:20,522 INFO L93 Difference]: Finished difference Result 26036 states and 35210 transitions. [2019-09-08 11:44:20,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:44:20,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:44:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:20,539 INFO L225 Difference]: With dead ends: 26036 [2019-09-08 11:44:20,540 INFO L226 Difference]: Without dead ends: 15642 [2019-09-08 11:44:20,551 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 11:44:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15642 states. [2019-09-08 11:44:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15642 to 11412. [2019-09-08 11:44:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11412 states. [2019-09-08 11:44:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11412 states to 11412 states and 15344 transitions. [2019-09-08 11:44:24,924 INFO L78 Accepts]: Start accepts. Automaton has 11412 states and 15344 transitions. Word has length 100 [2019-09-08 11:44:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:24,924 INFO L475 AbstractCegarLoop]: Abstraction has 11412 states and 15344 transitions. [2019-09-08 11:44:24,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:44:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11412 states and 15344 transitions. [2019-09-08 11:44:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:44:24,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:24,926 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] [2019-09-08 11:44:24,926 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash -212803225, now seen corresponding path program 1 times [2019-09-08 11:44:24,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:24,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:24,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:24,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:24,977 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 11:44:24,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:44:24,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:44:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:44:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:44:24,979 INFO L87 Difference]: Start difference. First operand 11412 states and 15344 transitions. Second operand 3 states. [2019-09-08 11:44:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:30,326 INFO L93 Difference]: Finished difference Result 25280 states and 33866 transitions. [2019-09-08 11:44:30,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:44:30,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:44:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:30,342 INFO L225 Difference]: With dead ends: 25280 [2019-09-08 11:44:30,342 INFO L226 Difference]: Without dead ends: 13986 [2019-09-08 11:44:30,354 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 11:44:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-09-08 11:44:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 10392. [2019-09-08 11:44:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10392 states. [2019-09-08 11:44:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10392 states to 10392 states and 13658 transitions. [2019-09-08 11:44:34,868 INFO L78 Accepts]: Start accepts. Automaton has 10392 states and 13658 transitions. Word has length 101 [2019-09-08 11:44:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:34,869 INFO L475 AbstractCegarLoop]: Abstraction has 10392 states and 13658 transitions. [2019-09-08 11:44:34,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:44:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 10392 states and 13658 transitions. [2019-09-08 11:44:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:44:34,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:34,870 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] [2019-09-08 11:44:34,870 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:34,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:34,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1682826315, now seen corresponding path program 1 times [2019-09-08 11:44:34,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:34,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:34,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:34,920 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 11:44:34,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:44:34,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:44:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:44:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:44:34,922 INFO L87 Difference]: Start difference. First operand 10392 states and 13658 transitions. Second operand 3 states. [2019-09-08 11:44:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:38,812 INFO L93 Difference]: Finished difference Result 20236 states and 26578 transitions. [2019-09-08 11:44:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:44:38,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:44:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:38,821 INFO L225 Difference]: With dead ends: 20236 [2019-09-08 11:44:38,821 INFO L226 Difference]: Without dead ends: 9962 [2019-09-08 11:44:38,831 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 11:44:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9962 states. [2019-09-08 11:44:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9962 to 9960. [2019-09-08 11:44:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9960 states. [2019-09-08 11:44:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 12926 transitions. [2019-09-08 11:44:42,689 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 12926 transitions. Word has length 102 [2019-09-08 11:44:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:42,689 INFO L475 AbstractCegarLoop]: Abstraction has 9960 states and 12926 transitions. [2019-09-08 11:44:42,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:44:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 12926 transitions. [2019-09-08 11:44:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:44:42,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:42,690 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] [2019-09-08 11:44:42,691 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1305322077, now seen corresponding path program 1 times [2019-09-08 11:44:42,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:42,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:42,739 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 11:44:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:44:42,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:44:42,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:44:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:44:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:44:42,740 INFO L87 Difference]: Start difference. First operand 9960 states and 12926 transitions. Second operand 3 states. [2019-09-08 11:44:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:44:46,999 INFO L93 Difference]: Finished difference Result 20732 states and 26976 transitions. [2019-09-08 11:44:47,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:44:47,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 11:44:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:44:47,012 INFO L225 Difference]: With dead ends: 20732 [2019-09-08 11:44:47,013 INFO L226 Difference]: Without dead ends: 10890 [2019-09-08 11:44:47,026 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 11:44:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-09-08 11:44:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10888. [2019-09-08 11:44:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10888 states. [2019-09-08 11:44:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10888 states to 10888 states and 14080 transitions. [2019-09-08 11:44:51,395 INFO L78 Accepts]: Start accepts. Automaton has 10888 states and 14080 transitions. Word has length 103 [2019-09-08 11:44:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:44:51,396 INFO L475 AbstractCegarLoop]: Abstraction has 10888 states and 14080 transitions. [2019-09-08 11:44:51,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:44:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 10888 states and 14080 transitions. [2019-09-08 11:44:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 11:44:51,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:44:51,399 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:44:51,399 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:44:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:44:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -297824867, now seen corresponding path program 1 times [2019-09-08 11:44:51,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:44:51,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:44:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:51,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:44:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:44:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:44:51,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:44:51,516 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) [2019-09-08 11:44:51,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:44:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:44:51,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:44:51,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:44:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:44:51,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:44:51,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:44:51,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:44:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:44:51,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:44:51,902 INFO L87 Difference]: Start difference. First operand 10888 states and 14080 transitions. Second operand 10 states. [2019-09-08 11:45:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:45:32,280 INFO L93 Difference]: Finished difference Result 110456 states and 142512 transitions. [2019-09-08 11:45:32,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:45:32,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-09-08 11:45:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:45:32,515 INFO L225 Difference]: With dead ends: 110456 [2019-09-08 11:45:32,515 INFO L226 Difference]: Without dead ends: 99686 [2019-09-08 11:45:32,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:45:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99686 states. [2019-09-08 11:45:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99686 to 28640. [2019-09-08 11:45:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28640 states. [2019-09-08 11:45:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28640 states to 28640 states and 36948 transitions. [2019-09-08 11:45:45,707 INFO L78 Accepts]: Start accepts. Automaton has 28640 states and 36948 transitions. Word has length 129 [2019-09-08 11:45:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:45:45,707 INFO L475 AbstractCegarLoop]: Abstraction has 28640 states and 36948 transitions. [2019-09-08 11:45:45,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:45:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28640 states and 36948 transitions. [2019-09-08 11:45:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 11:45:45,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:45:45,714 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:45:45,714 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:45:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:45:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash 689020841, now seen corresponding path program 1 times [2019-09-08 11:45:45,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:45:45,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:45:45,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:45,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:45:45,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:45:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:45:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:45:45,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:45:45,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:45:45,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:45:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:45:45,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:45:45,861 INFO L87 Difference]: Start difference. First operand 28640 states and 36948 transitions. Second operand 6 states. [2019-09-08 11:46:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:11,044 INFO L93 Difference]: Finished difference Result 89278 states and 115111 transitions. [2019-09-08 11:46:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:46:11,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-08 11:46:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:11,139 INFO L225 Difference]: With dead ends: 89278 [2019-09-08 11:46:11,139 INFO L226 Difference]: Without dead ends: 60756 [2019-09-08 11:46:11,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:46:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60756 states. [2019-09-08 11:46:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60756 to 35624. [2019-09-08 11:46:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35624 states. [2019-09-08 11:46:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35624 states to 35624 states and 45864 transitions. [2019-09-08 11:46:27,751 INFO L78 Accepts]: Start accepts. Automaton has 35624 states and 45864 transitions. Word has length 129 [2019-09-08 11:46:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:27,752 INFO L475 AbstractCegarLoop]: Abstraction has 35624 states and 45864 transitions. [2019-09-08 11:46:27,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:46:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 35624 states and 45864 transitions. [2019-09-08 11:46:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 11:46:27,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:27,756 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:46:27,756 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 610820055, now seen corresponding path program 1 times [2019-09-08 11:46:27,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:27,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:27,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:46:27,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:46:27,875 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 11:46:27,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:28,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:46:28,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:46:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 11:46:28,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:46:28,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:46:28,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:46:28,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:46:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:46:28,223 INFO L87 Difference]: Start difference. First operand 35624 states and 45864 transitions. Second operand 10 states. [2019-09-08 11:47:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:05,651 INFO L93 Difference]: Finished difference Result 118322 states and 152669 transitions. [2019-09-08 11:47:05,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:47:05,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-09-08 11:47:05,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:05,783 INFO L225 Difference]: With dead ends: 118322 [2019-09-08 11:47:05,784 INFO L226 Difference]: Without dead ends: 89800 [2019-09-08 11:47:05,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:47:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89800 states. [2019-09-08 11:47:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89800 to 51688. [2019-09-08 11:47:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51688 states. [2019-09-08 11:47:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51688 states to 51688 states and 66400 transitions. [2019-09-08 11:47:29,502 INFO L78 Accepts]: Start accepts. Automaton has 51688 states and 66400 transitions. Word has length 129 [2019-09-08 11:47:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:29,503 INFO L475 AbstractCegarLoop]: Abstraction has 51688 states and 66400 transitions. [2019-09-08 11:47:29,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:47:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 51688 states and 66400 transitions. [2019-09-08 11:47:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:47:29,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:29,508 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] [2019-09-08 11:47:29,508 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:29,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1632720289, now seen corresponding path program 1 times [2019-09-08 11:47:29,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:29,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:29,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:29,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:29,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:29,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:29,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:47:29,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:47:29,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:47:29,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:47:29,579 INFO L87 Difference]: Start difference. First operand 51688 states and 66400 transitions. Second operand 3 states. [2019-09-08 11:47:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:57,737 INFO L93 Difference]: Finished difference Result 114252 states and 146114 transitions. [2019-09-08 11:47:57,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:47:57,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-08 11:47:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:57,811 INFO L225 Difference]: With dead ends: 114252 [2019-09-08 11:47:57,811 INFO L226 Difference]: Without dead ends: 62682 [2019-09-08 11:47:57,861 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 11:47:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62682 states. [2019-09-08 11:48:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62682 to 59200. [2019-09-08 11:48:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59200 states. [2019-09-08 11:48:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59200 states to 59200 states and 74976 transitions. [2019-09-08 11:48:25,364 INFO L78 Accepts]: Start accepts. Automaton has 59200 states and 74976 transitions. Word has length 130 [2019-09-08 11:48:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:25,365 INFO L475 AbstractCegarLoop]: Abstraction has 59200 states and 74976 transitions. [2019-09-08 11:48:25,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59200 states and 74976 transitions. [2019-09-08 11:48:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:48:25,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:25,372 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:48:25,372 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:25,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2016651098, now seen corresponding path program 1 times [2019-09-08 11:48:25,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:25,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:25,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:25,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:25,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:25,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:48:25,500 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 11:48:25,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:48:25,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:48:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 11:48:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:48:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:48:25,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:48:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:48:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:48:25,784 INFO L87 Difference]: Start difference. First operand 59200 states and 74976 transitions. Second operand 10 states. [2019-09-08 11:49:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:35,652 INFO L93 Difference]: Finished difference Result 206230 states and 261887 transitions. [2019-09-08 11:49:35,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:49:35,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-09-08 11:49:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:35,836 INFO L225 Difference]: With dead ends: 206230 [2019-09-08 11:49:35,836 INFO L226 Difference]: Without dead ends: 155148 [2019-09-08 11:49:35,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:49:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155148 states. [2019-09-08 11:50:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155148 to 82376. [2019-09-08 11:50:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82376 states. [2019-09-08 11:50:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82376 states to 82376 states and 104224 transitions. [2019-09-08 11:50:13,091 INFO L78 Accepts]: Start accepts. Automaton has 82376 states and 104224 transitions. Word has length 130 [2019-09-08 11:50:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:13,091 INFO L475 AbstractCegarLoop]: Abstraction has 82376 states and 104224 transitions. [2019-09-08 11:50:13,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:50:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 82376 states and 104224 transitions. [2019-09-08 11:50:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:50:13,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:13,097 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:50:13,097 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash 733064444, now seen corresponding path program 1 times [2019-09-08 11:50:13,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:13,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 11:50:13,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:13,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:13,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:13,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:13,235 INFO L87 Difference]: Start difference. First operand 82376 states and 104224 transitions. Second operand 9 states. [2019-09-08 11:51:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:29,009 INFO L93 Difference]: Finished difference Result 246944 states and 312474 transitions. [2019-09-08 11:51:29,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:51:29,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 11:51:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:29,189 INFO L225 Difference]: With dead ends: 246944 [2019-09-08 11:51:29,189 INFO L226 Difference]: Without dead ends: 164674 [2019-09-08 11:51:29,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:51:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164674 states. [2019-09-08 11:52:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164674 to 82376. [2019-09-08 11:52:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82376 states. [2019-09-08 11:52:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82376 states to 82376 states and 104222 transitions. [2019-09-08 11:52:10,055 INFO L78 Accepts]: Start accepts. Automaton has 82376 states and 104222 transitions. Word has length 131 [2019-09-08 11:52:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:10,056 INFO L475 AbstractCegarLoop]: Abstraction has 82376 states and 104222 transitions. [2019-09-08 11:52:10,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:52:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 82376 states and 104222 transitions. [2019-09-08 11:52:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:52:10,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:10,061 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:52:10,061 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 104610750, now seen corresponding path program 1 times [2019-09-08 11:52:10,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:10,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:10,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:10,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:52:10,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:10,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:52:10,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:52:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:52:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:52:10,130 INFO L87 Difference]: Start difference. First operand 82376 states and 104222 transitions. Second operand 4 states. [2019-09-08 11:52:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:47,307 INFO L93 Difference]: Finished difference Result 164675 states and 208362 transitions. [2019-09-08 11:52:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:52:47,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 11:52:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:47,392 INFO L225 Difference]: With dead ends: 164675 [2019-09-08 11:52:47,392 INFO L226 Difference]: Without dead ends: 82417 [2019-09-08 11:52:47,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:52:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82417 states. [2019-09-08 11:53:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82417 to 82362. [2019-09-08 11:53:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82362 states. [2019-09-08 11:53:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82362 states to 82362 states and 104208 transitions. [2019-09-08 11:53:27,029 INFO L78 Accepts]: Start accepts. Automaton has 82362 states and 104208 transitions. Word has length 133 [2019-09-08 11:53:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:27,029 INFO L475 AbstractCegarLoop]: Abstraction has 82362 states and 104208 transitions. [2019-09-08 11:53:27,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:53:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 82362 states and 104208 transitions. [2019-09-08 11:53:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:53:27,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:27,035 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:53:27,035 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1846733149, now seen corresponding path program 1 times [2019-09-08 11:53:27,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:27,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:27,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:27,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:27,364 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-09-08 11:53:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:27,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:53:27,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:53:27,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:27,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 11:53:27,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:53:27,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:53:28,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:53:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:28,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:53:28,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-09-08 11:53:28,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:53:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:53:28,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:53:28,518 INFO L87 Difference]: Start difference. First operand 82362 states and 104208 transitions. Second operand 20 states. [2019-09-08 11:53:28,704 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 11:53:29,648 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 11:53:30,057 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 11:53:30,322 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-08 11:53:30,544 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-08 11:53:31,053 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 11:53:31,354 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-08 11:53:31,908 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:53:32,199 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 11:53:32,351 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 11:53:32,496 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-08 11:53:32,749 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:53:33,149 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 11:53:33,431 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 11:53:33,781 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-08 11:53:34,115 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 11:53:34,357 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:53:34,796 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:53:35,308 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:53:35,693 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:53:35,932 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-08 11:53:36,390 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:53:36,770 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-08 11:53:37,059 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-08 11:53:37,343 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 11:53:37,578 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-08 11:53:38,001 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 11:53:38,405 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 11:53:38,700 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 11:53:38,969 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:53:39,452 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 11:53:39,824 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-08 11:53:40,093 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-08 11:53:40,391 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 11:53:40,640 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 11:53:41,120 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:53:41,681 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-08 11:53:41,988 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 11:53:42,772 WARN L188 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 11:53:43,134 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 11:53:43,467 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-08 11:53:43,719 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:53:44,188 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:53:44,577 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-08 11:53:44,928 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-08 11:53:45,384 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 11:53:45,738 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 11:53:46,085 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:53:46,389 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 11:53:46,780 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 11:53:47,057 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 11:53:47,479 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-08 11:53:47,788 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-08 11:53:48,010 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 11:53:48,286 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 11:53:48,605 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 11:53:48,860 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:53:49,229 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-08 11:53:49,506 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 11:53:49,997 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:53:50,293 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-08 11:53:50,567 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 11:53:51,002 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 11:53:51,468 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-08 11:53:52,231 WARN L188 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 11:53:52,686 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 11:53:53,020 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 11:53:53,320 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 11:53:53,672 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-08 11:53:53,959 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-08 11:53:54,277 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 11:53:54,578 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 11:53:54,896 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 11:53:55,242 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 11:53:55,592 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-08 11:53:58,318 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 11:53:58,756 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-08 11:53:59,119 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-08 11:53:59,462 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-08 11:53:59,712 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-08 11:54:00,310 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 11:54:00,802 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 11:54:01,298 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 11:54:01,614 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 11:54:01,992 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:54:02,312 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 11:54:02,612 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 11:54:02,869 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 11:54:03,111 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:54:03,496 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-08 11:54:03,747 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-08 11:54:03,969 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-08 11:54:04,284 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 11:54:04,929 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 11:54:05,348 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 11:54:05,681 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 11:54:06,241 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 11:54:06,461 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:54:06,884 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-08 11:54:07,522 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 11:54:07,981 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:54:08,212 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 11:54:09,140 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 11:54:09,597 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 11:54:19,964 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-08 11:54:21,392 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 11:54:21,734 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 11:54:22,354 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:54:22,970 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-08 11:54:23,524 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-08 11:54:23,893 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-08 11:54:24,116 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-08 11:54:24,331 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 11:54:24,699 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 11:54:25,703 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-08 11:54:26,286 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:54:26,640 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 11:54:27,068 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:54:27,435 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 11:54:27,743 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-08 11:54:28,158 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:54:28,414 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 11:54:28,794 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 11:54:29,139 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 11:54:29,647 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:54:30,114 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-08 11:54:30,448 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:54:30,670 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-08 11:54:31,001 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-08 11:54:31,273 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-08 11:54:31,792 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-08 11:54:32,241 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 11:54:32,664 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-08 11:54:33,052 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 11:54:33,297 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:54:34,180 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-08 11:54:34,447 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 11:54:35,205 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-08 11:54:35,481 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 11:54:35,806 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-08 11:54:36,205 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:54:36,453 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 11:54:36,834 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:54:37,076 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:54:37,830 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:54:38,184 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-08 11:54:38,446 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 11:54:38,889 WARN L188 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-08 11:54:39,161 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-08 11:54:39,536 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:54:39,812 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-08 11:54:40,232 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:54:40,756 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:54:41,040 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-08 11:54:41,346 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 11:54:41,620 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 11:54:41,932 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-08 11:54:42,275 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 11:54:42,541 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:54:42,803 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:54:44,259 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:54:44,548 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-08 11:54:44,938 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 11:54:45,939 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 11:54:46,453 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:54:46,703 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:54:47,229 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-08 11:54:47,597 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 11:54:47,963 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:54:48,176 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:54:48,361 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:54:49,197 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 11:54:50,000 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 11:54:51,044 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 11:54:52,355 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-08 11:54:52,682 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 11:54:52,916 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:54:53,239 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 11:54:53,964 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:54:55,135 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-08 11:54:55,388 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 11:54:55,782 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:54:56,699 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-08 11:54:57,538 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:54:57,923 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 11:54:58,195 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:54:58,854 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 11:54:59,094 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 11:54:59,515 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:55:00,362 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:55:01,096 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-08 11:55:01,834 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-08 11:55:02,301 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-09-08 11:55:03,174 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 11:55:04,028 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:55:13,456 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 11:55:13,759 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:55:30,539 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 11:55:33,302 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64