java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:31:53,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:31:53,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:31:53,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:31:53,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:31:53,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:31:53,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:31:53,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:31:53,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:31:53,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:31:53,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:31:53,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:31:53,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:31:53,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:31:53,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:31:53,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:31:53,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:31:53,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:31:53,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:31:53,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:31:53,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:31:53,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:31:53,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:31:53,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:31:53,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:31:53,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:31:53,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:31:53,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:31:53,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:31:53,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:31:53,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:31:53,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:31:53,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:31:53,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:31:53,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:31:53,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:31:53,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:31:53,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:31:53,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:31:53,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:31:53,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:31:53,323 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 10:31:53,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:31:53,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:31:53,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:31:53,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:31:53,339 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:31:53,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:31:53,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:31:53,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:31:53,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:31:53,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:31:53,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:31:53,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:31:53,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:31:53,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:31:53,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:31:53,341 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:31:53,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:31:53,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:31:53,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:31:53,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:31:53,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:31:53,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:31:53,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:31:53,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:31:53,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:31:53,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:31:53,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:31:53,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:31:53,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:31:53,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:31:53,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:31:53,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:31:53,402 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:31:53,403 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:31:53,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:31:53,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0810e02b0/ee5476526b244103af973d734eb6617e/FLAG1dbebc583 [2019-09-08 10:31:54,187 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:31:54,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:31:54,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0810e02b0/ee5476526b244103af973d734eb6617e/FLAG1dbebc583 [2019-09-08 10:31:54,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0810e02b0/ee5476526b244103af973d734eb6617e [2019-09-08 10:31:54,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:31:54,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:31:54,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:31:54,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:31:54,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:31:54,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:31:54" (1/1) ... [2019-09-08 10:31:54,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67837e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:54, skipping insertion in model container [2019-09-08 10:31:54,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:31:54" (1/1) ... [2019-09-08 10:31:54,376 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:31:54,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:31:55,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:31:55,667 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:31:56,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:31:56,334 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:31:56,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56 WrapperNode [2019-09-08 10:31:56,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:31:56,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:31:56,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:31:56,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:31:56,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (1/1) ... [2019-09-08 10:31:56,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (1/1) ... [2019-09-08 10:31:56,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (1/1) ... [2019-09-08 10:31:56,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (1/1) ... [2019-09-08 10:31:56,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (1/1) ... [2019-09-08 10:31:56,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (1/1) ... [2019-09-08 10:31:56,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (1/1) ... [2019-09-08 10:31:56,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:31:56,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:31:56,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:31:56,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:31:56,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (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 10:31:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:31:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:31:56,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:31:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:31:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:31:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:31:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:31:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:31:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:31:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:31:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:31:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:31:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:31:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:31:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:31:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:31:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:31:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:32:00,810 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:32:00,810 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:32:00,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:32:00 BoogieIcfgContainer [2019-09-08 10:32:00,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:32:00,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:32:00,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:32:00,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:32:00,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:31:54" (1/3) ... [2019-09-08 10:32:00,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c3ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:32:00, skipping insertion in model container [2019-09-08 10:32:00,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:31:56" (2/3) ... [2019-09-08 10:32:00,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c3ac2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:32:00, skipping insertion in model container [2019-09-08 10:32:00,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:32:00" (3/3) ... [2019-09-08 10:32:00,821 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-08 10:32:00,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:32:00,843 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-08 10:32:00,867 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-08 10:32:00,915 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:32:00,916 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:32:00,916 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:32:00,917 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:32:00,917 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:32:00,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:32:00,917 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:32:00,918 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:32:00,918 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:32:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-09-08 10:32:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:32:00,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:00,987 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] [2019-09-08 10:32:00,990 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-09-08 10:32:01,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:01,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:01,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:01,649 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 10:32:01,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:01,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:32:01,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:32:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:32:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:32:01,674 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-09-08 10:32:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:04,150 INFO L93 Difference]: Finished difference Result 2522 states and 4334 transitions. [2019-09-08 10:32:04,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:32:04,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-08 10:32:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:04,178 INFO L225 Difference]: With dead ends: 2522 [2019-09-08 10:32:04,179 INFO L226 Difference]: Without dead ends: 1594 [2019-09-08 10:32:04,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:32:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-09-08 10:32:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2019-09-08 10:32:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-09-08 10:32:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2070 transitions. [2019-09-08 10:32:04,362 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2070 transitions. Word has length 56 [2019-09-08 10:32:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:04,363 INFO L475 AbstractCegarLoop]: Abstraction has 1588 states and 2070 transitions. [2019-09-08 10:32:04,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:32:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2070 transitions. [2019-09-08 10:32:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:32:04,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:04,373 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] [2019-09-08 10:32:04,374 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-09-08 10:32:04,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:04,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:04,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:04,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:04,642 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 10:32:04,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:04,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:32:04,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:32:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:32:04,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:32:04,645 INFO L87 Difference]: Start difference. First operand 1588 states and 2070 transitions. Second operand 6 states. [2019-09-08 10:32:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:06,582 INFO L93 Difference]: Finished difference Result 3593 states and 4735 transitions. [2019-09-08 10:32:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:32:06,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:32:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:06,598 INFO L225 Difference]: With dead ends: 3593 [2019-09-08 10:32:06,599 INFO L226 Difference]: Without dead ends: 2603 [2019-09-08 10:32:06,603 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 10:32:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-09-08 10:32:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2580. [2019-09-08 10:32:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2019-09-08 10:32:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3414 transitions. [2019-09-08 10:32:06,736 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3414 transitions. Word has length 57 [2019-09-08 10:32:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:06,737 INFO L475 AbstractCegarLoop]: Abstraction has 2580 states and 3414 transitions. [2019-09-08 10:32:06,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:32:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3414 transitions. [2019-09-08 10:32:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:32:06,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:06,741 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] [2019-09-08 10:32:06,741 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-09-08 10:32:06,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:06,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:06,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:06,974 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 10:32:06,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:06,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:32:06,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:32:06,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:32:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:32:06,976 INFO L87 Difference]: Start difference. First operand 2580 states and 3414 transitions. Second operand 6 states. [2019-09-08 10:32:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:08,580 INFO L93 Difference]: Finished difference Result 6102 states and 8181 transitions. [2019-09-08 10:32:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:32:08,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:32:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:08,604 INFO L225 Difference]: With dead ends: 6102 [2019-09-08 10:32:08,605 INFO L226 Difference]: Without dead ends: 4454 [2019-09-08 10:32:08,610 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 10:32:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-09-08 10:32:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4438. [2019-09-08 10:32:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-08 10:32:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5921 transitions. [2019-09-08 10:32:08,832 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5921 transitions. Word has length 57 [2019-09-08 10:32:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:08,833 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5921 transitions. [2019-09-08 10:32:08,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:32:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5921 transitions. [2019-09-08 10:32:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:32:08,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:08,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:08,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-09-08 10:32:08,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:08,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:32:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:32:09,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:32:09,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:32:09,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:32:09,123 INFO L87 Difference]: Start difference. First operand 4438 states and 5921 transitions. Second operand 9 states. [2019-09-08 10:32:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:12,477 INFO L93 Difference]: Finished difference Result 8492 states and 12034 transitions. [2019-09-08 10:32:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:32:12,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:32:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:12,519 INFO L225 Difference]: With dead ends: 8492 [2019-09-08 10:32:12,519 INFO L226 Difference]: Without dead ends: 8486 [2019-09-08 10:32:12,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:32:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-09-08 10:32:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4438. [2019-09-08 10:32:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-08 10:32:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5920 transitions. [2019-09-08 10:32:12,817 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5920 transitions. Word has length 59 [2019-09-08 10:32:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:12,818 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5920 transitions. [2019-09-08 10:32:12,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:32:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5920 transitions. [2019-09-08 10:32:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:32:12,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:12,825 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] [2019-09-08 10:32:12,825 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:12,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-09-08 10:32:12,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:12,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:12,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:12,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:12,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:13,045 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 10:32:13,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:13,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:32:13,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:32:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:32:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:32:13,046 INFO L87 Difference]: Start difference. First operand 4438 states and 5920 transitions. Second operand 9 states. [2019-09-08 10:32:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:17,127 INFO L93 Difference]: Finished difference Result 12604 states and 17782 transitions. [2019-09-08 10:32:17,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:32:17,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:32:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:17,185 INFO L225 Difference]: With dead ends: 12604 [2019-09-08 10:32:17,186 INFO L226 Difference]: Without dead ends: 11461 [2019-09-08 10:32:17,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:32:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-09-08 10:32:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4438. [2019-09-08 10:32:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-08 10:32:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5919 transitions. [2019-09-08 10:32:17,517 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5919 transitions. Word has length 59 [2019-09-08 10:32:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:17,518 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5919 transitions. [2019-09-08 10:32:17,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:32:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5919 transitions. [2019-09-08 10:32:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:32:17,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:17,522 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] [2019-09-08 10:32:17,523 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-09-08 10:32:17,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:17,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:17,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:17,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:17,811 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 10:32:17,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:17,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:32:17,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:32:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:32:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:32:17,814 INFO L87 Difference]: Start difference. First operand 4438 states and 5919 transitions. Second operand 8 states. [2019-09-08 10:32:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:20,995 INFO L93 Difference]: Finished difference Result 9646 states and 13819 transitions. [2019-09-08 10:32:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:32:21,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-08 10:32:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:21,019 INFO L225 Difference]: With dead ends: 9646 [2019-09-08 10:32:21,020 INFO L226 Difference]: Without dead ends: 8253 [2019-09-08 10:32:21,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:32:21,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2019-09-08 10:32:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 4438. [2019-09-08 10:32:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-08 10:32:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5918 transitions. [2019-09-08 10:32:21,256 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5918 transitions. Word has length 59 [2019-09-08 10:32:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:21,257 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5918 transitions. [2019-09-08 10:32:21,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:32:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5918 transitions. [2019-09-08 10:32:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:32:21,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:21,264 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] [2019-09-08 10:32:21,264 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-09-08 10:32:21,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:21,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:21,348 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 10:32:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:21,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:21,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:21,350 INFO L87 Difference]: Start difference. First operand 4438 states and 5918 transitions. Second operand 3 states. [2019-09-08 10:32:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:21,810 INFO L93 Difference]: Finished difference Result 8143 states and 11088 transitions. [2019-09-08 10:32:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:21,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:32:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:21,826 INFO L225 Difference]: With dead ends: 8143 [2019-09-08 10:32:21,827 INFO L226 Difference]: Without dead ends: 5548 [2019-09-08 10:32:21,833 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 10:32:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-09-08 10:32:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5542. [2019-09-08 10:32:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-09-08 10:32:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7349 transitions. [2019-09-08 10:32:22,278 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7349 transitions. Word has length 60 [2019-09-08 10:32:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:22,279 INFO L475 AbstractCegarLoop]: Abstraction has 5542 states and 7349 transitions. [2019-09-08 10:32:22,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7349 transitions. [2019-09-08 10:32:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:32:22,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:22,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:32:22,285 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-09-08 10:32:22,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:22,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:22,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:22,396 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 10:32:22,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:22,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:22,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:22,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:22,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:22,399 INFO L87 Difference]: Start difference. First operand 5542 states and 7349 transitions. Second operand 3 states. [2019-09-08 10:32:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:22,829 INFO L93 Difference]: Finished difference Result 9044 states and 12648 transitions. [2019-09-08 10:32:22,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:22,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:32:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:22,846 INFO L225 Difference]: With dead ends: 9044 [2019-09-08 10:32:22,846 INFO L226 Difference]: Without dead ends: 6694 [2019-09-08 10:32:22,853 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 10:32:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2019-09-08 10:32:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6090. [2019-09-08 10:32:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-09-08 10:32:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 8232 transitions. [2019-09-08 10:32:23,392 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 8232 transitions. Word has length 60 [2019-09-08 10:32:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:23,392 INFO L475 AbstractCegarLoop]: Abstraction has 6090 states and 8232 transitions. [2019-09-08 10:32:23,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 8232 transitions. [2019-09-08 10:32:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:32:23,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:23,397 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] [2019-09-08 10:32:23,397 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-09-08 10:32:23,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:23,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:23,473 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 10:32:23,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:23,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:23,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:23,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:23,475 INFO L87 Difference]: Start difference. First operand 6090 states and 8232 transitions. Second operand 3 states. [2019-09-08 10:32:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:24,361 INFO L93 Difference]: Finished difference Result 11404 states and 16131 transitions. [2019-09-08 10:32:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:24,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:32:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:24,380 INFO L225 Difference]: With dead ends: 11404 [2019-09-08 10:32:24,380 INFO L226 Difference]: Without dead ends: 8067 [2019-09-08 10:32:24,391 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 10:32:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-09-08 10:32:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 7151. [2019-09-08 10:32:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-09-08 10:32:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9773 transitions. [2019-09-08 10:32:24,968 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9773 transitions. Word has length 60 [2019-09-08 10:32:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:24,968 INFO L475 AbstractCegarLoop]: Abstraction has 7151 states and 9773 transitions. [2019-09-08 10:32:24,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9773 transitions. [2019-09-08 10:32:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:32:24,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:24,973 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] [2019-09-08 10:32:24,973 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-09-08 10:32:24,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:25,059 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 10:32:25,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:25,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:25,060 INFO L87 Difference]: Start difference. First operand 7151 states and 9773 transitions. Second operand 3 states. [2019-09-08 10:32:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:25,948 INFO L93 Difference]: Finished difference Result 15308 states and 21660 transitions. [2019-09-08 10:32:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:25,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:32:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:25,967 INFO L225 Difference]: With dead ends: 15308 [2019-09-08 10:32:25,967 INFO L226 Difference]: Without dead ends: 9721 [2019-09-08 10:32:25,980 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 10:32:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9721 states. [2019-09-08 10:32:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9721 to 7854. [2019-09-08 10:32:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-09-08 10:32:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 11004 transitions. [2019-09-08 10:32:26,847 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 11004 transitions. Word has length 61 [2019-09-08 10:32:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:26,847 INFO L475 AbstractCegarLoop]: Abstraction has 7854 states and 11004 transitions. [2019-09-08 10:32:26,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 11004 transitions. [2019-09-08 10:32:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:32:26,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:26,922 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] [2019-09-08 10:32:26,922 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:26,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-09-08 10:32:26,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:26,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:26,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:27,499 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 10:32:27,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:27,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:32:27,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:32:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:32:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:32:27,500 INFO L87 Difference]: Start difference. First operand 7854 states and 11004 transitions. Second operand 12 states. [2019-09-08 10:32:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:30,802 INFO L93 Difference]: Finished difference Result 17760 states and 25427 transitions. [2019-09-08 10:32:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:32:30,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-08 10:32:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:30,827 INFO L225 Difference]: With dead ends: 17760 [2019-09-08 10:32:30,827 INFO L226 Difference]: Without dead ends: 17569 [2019-09-08 10:32:30,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:32:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17569 states. [2019-09-08 10:32:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17569 to 7853. [2019-09-08 10:32:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7853 states. [2019-09-08 10:32:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 11002 transitions. [2019-09-08 10:32:31,691 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 11002 transitions. Word has length 61 [2019-09-08 10:32:31,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:31,691 INFO L475 AbstractCegarLoop]: Abstraction has 7853 states and 11002 transitions. [2019-09-08 10:32:31,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:32:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 11002 transitions. [2019-09-08 10:32:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:32:31,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:31,694 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] [2019-09-08 10:32:31,694 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:31,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash -169233154, now seen corresponding path program 1 times [2019-09-08 10:32:31,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:31,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:31,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:31,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:31,772 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 10:32:31,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:31,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:31,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:31,774 INFO L87 Difference]: Start difference. First operand 7853 states and 11002 transitions. Second operand 3 states. [2019-09-08 10:32:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:32,926 INFO L93 Difference]: Finished difference Result 18759 states and 26911 transitions. [2019-09-08 10:32:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:32,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:32:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:32,941 INFO L225 Difference]: With dead ends: 18759 [2019-09-08 10:32:32,942 INFO L226 Difference]: Without dead ends: 11947 [2019-09-08 10:32:32,959 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 10:32:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2019-09-08 10:32:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 9434. [2019-09-08 10:32:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9434 states. [2019-09-08 10:32:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9434 states to 9434 states and 13446 transitions. [2019-09-08 10:32:33,870 INFO L78 Accepts]: Start accepts. Automaton has 9434 states and 13446 transitions. Word has length 61 [2019-09-08 10:32:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:33,870 INFO L475 AbstractCegarLoop]: Abstraction has 9434 states and 13446 transitions. [2019-09-08 10:32:33,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 9434 states and 13446 transitions. [2019-09-08 10:32:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:32:33,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:33,872 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] [2019-09-08 10:32:33,872 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:33,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:33,872 INFO L82 PathProgramCache]: Analyzing trace with hash 58994233, now seen corresponding path program 1 times [2019-09-08 10:32:33,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:33,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:33,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:33,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:33,961 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 10:32:33,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:33,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:32:33,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:32:33,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:32:33,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:32:33,963 INFO L87 Difference]: Start difference. First operand 9434 states and 13446 transitions. Second operand 3 states. [2019-09-08 10:32:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:35,076 INFO L93 Difference]: Finished difference Result 19912 states and 28616 transitions. [2019-09-08 10:32:35,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:32:35,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:32:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:35,087 INFO L225 Difference]: With dead ends: 19912 [2019-09-08 10:32:35,087 INFO L226 Difference]: Without dead ends: 10904 [2019-09-08 10:32:35,097 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 10:32:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10904 states. [2019-09-08 10:32:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10904 to 8669. [2019-09-08 10:32:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8669 states. [2019-09-08 10:32:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8669 states to 8669 states and 12445 transitions. [2019-09-08 10:32:35,848 INFO L78 Accepts]: Start accepts. Automaton has 8669 states and 12445 transitions. Word has length 61 [2019-09-08 10:32:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:35,848 INFO L475 AbstractCegarLoop]: Abstraction has 8669 states and 12445 transitions. [2019-09-08 10:32:35,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:32:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8669 states and 12445 transitions. [2019-09-08 10:32:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:32:35,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:35,849 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] [2019-09-08 10:32:35,850 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash -244084559, now seen corresponding path program 1 times [2019-09-08 10:32:35,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:35,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:35,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:36,534 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 10:32:36,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:32:36,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:32:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:32:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:32:36,535 INFO L87 Difference]: Start difference. First operand 8669 states and 12445 transitions. Second operand 13 states. [2019-09-08 10:32:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:39,312 INFO L93 Difference]: Finished difference Result 9890 states and 14160 transitions. [2019-09-08 10:32:39,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:32:39,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-08 10:32:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:39,324 INFO L225 Difference]: With dead ends: 9890 [2019-09-08 10:32:39,325 INFO L226 Difference]: Without dead ends: 9886 [2019-09-08 10:32:39,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:32:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9886 states. [2019-09-08 10:32:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9886 to 8682. [2019-09-08 10:32:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8682 states. [2019-09-08 10:32:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8682 states to 8682 states and 12463 transitions. [2019-09-08 10:32:40,200 INFO L78 Accepts]: Start accepts. Automaton has 8682 states and 12463 transitions. Word has length 62 [2019-09-08 10:32:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:40,200 INFO L475 AbstractCegarLoop]: Abstraction has 8682 states and 12463 transitions. [2019-09-08 10:32:40,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:32:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 8682 states and 12463 transitions. [2019-09-08 10:32:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:32:40,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:40,203 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] [2019-09-08 10:32:40,203 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash 271982167, now seen corresponding path program 1 times [2019-09-08 10:32:40,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:40,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:40,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:40,804 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 10:32:40,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:40,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:32:40,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:32:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:32:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:32:40,806 INFO L87 Difference]: Start difference. First operand 8682 states and 12463 transitions. Second operand 14 states. [2019-09-08 10:32:41,400 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 10:32:41,596 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 10:32:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:46,171 INFO L93 Difference]: Finished difference Result 19772 states and 28379 transitions. [2019-09-08 10:32:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 10:32:46,171 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-09-08 10:32:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:46,195 INFO L225 Difference]: With dead ends: 19772 [2019-09-08 10:32:46,195 INFO L226 Difference]: Without dead ends: 19518 [2019-09-08 10:32:46,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:32:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19518 states. [2019-09-08 10:32:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19518 to 8622. [2019-09-08 10:32:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8622 states. [2019-09-08 10:32:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8622 states to 8622 states and 12388 transitions. [2019-09-08 10:32:47,198 INFO L78 Accepts]: Start accepts. Automaton has 8622 states and 12388 transitions. Word has length 62 [2019-09-08 10:32:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:47,199 INFO L475 AbstractCegarLoop]: Abstraction has 8622 states and 12388 transitions. [2019-09-08 10:32:47,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:32:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8622 states and 12388 transitions. [2019-09-08 10:32:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:32:47,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:47,201 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 10:32:47,201 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2056344142, now seen corresponding path program 1 times [2019-09-08 10:32:47,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:47,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:47,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:47,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:47,960 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 10:32:47,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:47,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:32:47,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:32:47,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:32:47,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:32:47,962 INFO L87 Difference]: Start difference. First operand 8622 states and 12388 transitions. Second operand 14 states. [2019-09-08 10:32:48,512 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-08 10:32:49,126 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-08 10:32:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:53,171 INFO L93 Difference]: Finished difference Result 19520 states and 28177 transitions. [2019-09-08 10:32:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:32:53,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-09-08 10:32:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:53,193 INFO L225 Difference]: With dead ends: 19520 [2019-09-08 10:32:53,193 INFO L226 Difference]: Without dead ends: 19516 [2019-09-08 10:32:53,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:32:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19516 states. [2019-09-08 10:32:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19516 to 8618. [2019-09-08 10:32:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8618 states. [2019-09-08 10:32:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8618 states to 8618 states and 12384 transitions. [2019-09-08 10:32:54,137 INFO L78 Accepts]: Start accepts. Automaton has 8618 states and 12384 transitions. Word has length 63 [2019-09-08 10:32:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:54,137 INFO L475 AbstractCegarLoop]: Abstraction has 8618 states and 12384 transitions. [2019-09-08 10:32:54,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:32:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 8618 states and 12384 transitions. [2019-09-08 10:32:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:32:54,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:54,139 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 10:32:54,139 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1004192523, now seen corresponding path program 1 times [2019-09-08 10:32:54,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:54,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:54,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:54,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 10:32:54,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:54,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:32:54,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:32:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:32:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:32:54,555 INFO L87 Difference]: Start difference. First operand 8618 states and 12384 transitions. Second operand 11 states. [2019-09-08 10:32:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:59,879 INFO L93 Difference]: Finished difference Result 27020 states and 38783 transitions. [2019-09-08 10:32:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:32:59,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-09-08 10:32:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:59,917 INFO L225 Difference]: With dead ends: 27020 [2019-09-08 10:32:59,918 INFO L226 Difference]: Without dead ends: 26776 [2019-09-08 10:32:59,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:32:59,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26776 states. [2019-09-08 10:33:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26776 to 8556. [2019-09-08 10:33:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8556 states. [2019-09-08 10:33:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8556 states to 8556 states and 12304 transitions. [2019-09-08 10:33:01,199 INFO L78 Accepts]: Start accepts. Automaton has 8556 states and 12304 transitions. Word has length 63 [2019-09-08 10:33:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:01,199 INFO L475 AbstractCegarLoop]: Abstraction has 8556 states and 12304 transitions. [2019-09-08 10:33:01,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:33:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8556 states and 12304 transitions. [2019-09-08 10:33:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:33:01,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:01,202 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] [2019-09-08 10:33:01,202 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:01,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2123353110, now seen corresponding path program 1 times [2019-09-08 10:33:01,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:01,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:01,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:01,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:01,306 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 10:33:01,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:01,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:33:01,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:33:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:33:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:33:01,308 INFO L87 Difference]: Start difference. First operand 8556 states and 12304 transitions. Second operand 6 states. [2019-09-08 10:33:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:33:05,752 INFO L93 Difference]: Finished difference Result 37854 states and 54693 transitions. [2019-09-08 10:33:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:33:05,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:33:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:33:05,783 INFO L225 Difference]: With dead ends: 37854 [2019-09-08 10:33:05,783 INFO L226 Difference]: Without dead ends: 30026 [2019-09-08 10:33:05,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:33:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30026 states. [2019-09-08 10:33:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30026 to 26354. [2019-09-08 10:33:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26354 states. [2019-09-08 10:33:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26354 states to 26354 states and 37175 transitions. [2019-09-08 10:33:10,311 INFO L78 Accepts]: Start accepts. Automaton has 26354 states and 37175 transitions. Word has length 70 [2019-09-08 10:33:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:10,311 INFO L475 AbstractCegarLoop]: Abstraction has 26354 states and 37175 transitions. [2019-09-08 10:33:10,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:33:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 26354 states and 37175 transitions. [2019-09-08 10:33:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:33:10,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:10,315 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 10:33:10,316 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:10,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1078555367, now seen corresponding path program 1 times [2019-09-08 10:33:10,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:10,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:10,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:10,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:10,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:10,420 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 10:33:10,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:10,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:33:10,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:33:10,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:33:10,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:33:10,422 INFO L87 Difference]: Start difference. First operand 26354 states and 37175 transitions. Second operand 5 states. [2019-09-08 10:33:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:33:13,747 INFO L93 Difference]: Finished difference Result 46288 states and 65313 transitions. [2019-09-08 10:33:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:33:13,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:33:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:33:13,774 INFO L225 Difference]: With dead ends: 46288 [2019-09-08 10:33:13,774 INFO L226 Difference]: Without dead ends: 20652 [2019-09-08 10:33:13,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:33:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20652 states. [2019-09-08 10:33:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20652 to 20648. [2019-09-08 10:33:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20648 states. [2019-09-08 10:33:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20648 states to 20648 states and 28948 transitions. [2019-09-08 10:33:17,158 INFO L78 Accepts]: Start accepts. Automaton has 20648 states and 28948 transitions. Word has length 71 [2019-09-08 10:33:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:17,158 INFO L475 AbstractCegarLoop]: Abstraction has 20648 states and 28948 transitions. [2019-09-08 10:33:17,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:33:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20648 states and 28948 transitions. [2019-09-08 10:33:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:33:17,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:17,161 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 10:33:17,162 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash 781945202, now seen corresponding path program 1 times [2019-09-08 10:33:17,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:17,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:17,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:17,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:17,279 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 10:33:17,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:17,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:33:17,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:33:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:33:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:33:17,281 INFO L87 Difference]: Start difference. First operand 20648 states and 28948 transitions. Second operand 6 states. [2019-09-08 10:33:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:33:23,776 INFO L93 Difference]: Finished difference Result 35892 states and 49755 transitions. [2019-09-08 10:33:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:33:23,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-08 10:33:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:33:23,813 INFO L225 Difference]: With dead ends: 35892 [2019-09-08 10:33:23,813 INFO L226 Difference]: Without dead ends: 35890 [2019-09-08 10:33:23,820 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 10:33:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35890 states. [2019-09-08 10:33:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35890 to 21314. [2019-09-08 10:33:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21314 states. [2019-09-08 10:33:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21314 states to 21314 states and 29457 transitions. [2019-09-08 10:33:27,478 INFO L78 Accepts]: Start accepts. Automaton has 21314 states and 29457 transitions. Word has length 73 [2019-09-08 10:33:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:27,478 INFO L475 AbstractCegarLoop]: Abstraction has 21314 states and 29457 transitions. [2019-09-08 10:33:27,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:33:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21314 states and 29457 transitions. [2019-09-08 10:33:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:33:27,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:27,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, 1, 1, 1, 1, 1] [2019-09-08 10:33:27,482 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:27,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1414482205, now seen corresponding path program 1 times [2019-09-08 10:33:27,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:27,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:27,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:27,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:27,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:27,579 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 10:33:27,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:27,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:33:27,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:33:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:33:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:33:27,581 INFO L87 Difference]: Start difference. First operand 21314 states and 29457 transitions. Second operand 3 states. [2019-09-08 10:33:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:33:34,267 INFO L93 Difference]: Finished difference Result 57914 states and 80176 transitions. [2019-09-08 10:33:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:33:34,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:33:34,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:33:34,313 INFO L225 Difference]: With dead ends: 57914 [2019-09-08 10:33:34,313 INFO L226 Difference]: Without dead ends: 37318 [2019-09-08 10:33:34,332 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 10:33:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37318 states. [2019-09-08 10:33:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37318 to 37316. [2019-09-08 10:33:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37316 states. [2019-09-08 10:33:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37316 states to 37316 states and 51151 transitions. [2019-09-08 10:33:40,392 INFO L78 Accepts]: Start accepts. Automaton has 37316 states and 51151 transitions. Word has length 74 [2019-09-08 10:33:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:40,392 INFO L475 AbstractCegarLoop]: Abstraction has 37316 states and 51151 transitions. [2019-09-08 10:33:40,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:33:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 37316 states and 51151 transitions. [2019-09-08 10:33:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:33:40,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:40,396 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 10:33:40,396 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1190739596, now seen corresponding path program 1 times [2019-09-08 10:33:40,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:40,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:33:40,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:40,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:33:40,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:33:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:33:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:33:40,495 INFO L87 Difference]: Start difference. First operand 37316 states and 51151 transitions. Second operand 5 states. [2019-09-08 10:33:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:33:59,267 INFO L93 Difference]: Finished difference Result 133774 states and 183150 transitions. [2019-09-08 10:33:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:33:59,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 10:33:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:33:59,390 INFO L225 Difference]: With dead ends: 133774 [2019-09-08 10:33:59,391 INFO L226 Difference]: Without dead ends: 97113 [2019-09-08 10:33:59,437 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 10:33:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97113 states. [2019-09-08 10:34:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97113 to 36885. [2019-09-08 10:34:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36885 states. [2019-09-08 10:34:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 49924 transitions. [2019-09-08 10:34:06,183 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 49924 transitions. Word has length 76 [2019-09-08 10:34:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:06,183 INFO L475 AbstractCegarLoop]: Abstraction has 36885 states and 49924 transitions. [2019-09-08 10:34:06,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 49924 transitions. [2019-09-08 10:34:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:34:06,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:06,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:34:06,187 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2062750855, now seen corresponding path program 1 times [2019-09-08 10:34:06,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:06,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:06,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:06,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:06,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:06,269 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 10:34:06,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:06,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:06,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:06,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:06,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:06,271 INFO L87 Difference]: Start difference. First operand 36885 states and 49924 transitions. Second operand 3 states. [2019-09-08 10:34:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:13,600 INFO L93 Difference]: Finished difference Result 46779 states and 63220 transitions. [2019-09-08 10:34:13,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:13,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:34:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:13,642 INFO L225 Difference]: With dead ends: 46779 [2019-09-08 10:34:13,642 INFO L226 Difference]: Without dead ends: 36887 [2019-09-08 10:34:13,658 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 10:34:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36887 states. [2019-09-08 10:34:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36887 to 30339. [2019-09-08 10:34:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30339 states. [2019-09-08 10:34:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30339 states to 30339 states and 40652 transitions. [2019-09-08 10:34:19,313 INFO L78 Accepts]: Start accepts. Automaton has 30339 states and 40652 transitions. Word has length 77 [2019-09-08 10:34:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:19,313 INFO L475 AbstractCegarLoop]: Abstraction has 30339 states and 40652 transitions. [2019-09-08 10:34:19,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30339 states and 40652 transitions. [2019-09-08 10:34:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:34:19,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:19,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:34:19,317 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash -667932309, now seen corresponding path program 1 times [2019-09-08 10:34:19,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:19,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:19,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:19,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:19,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:19,411 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 10:34:19,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:19,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:19,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:19,412 INFO L87 Difference]: Start difference. First operand 30339 states and 40652 transitions. Second operand 5 states. [2019-09-08 10:34:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:39,791 INFO L93 Difference]: Finished difference Result 126908 states and 169318 transitions. [2019-09-08 10:34:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:34:39,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 10:34:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:39,923 INFO L225 Difference]: With dead ends: 126908 [2019-09-08 10:34:39,923 INFO L226 Difference]: Without dead ends: 97255 [2019-09-08 10:34:39,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:34:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97255 states. [2019-09-08 10:34:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97255 to 50483. [2019-09-08 10:34:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50483 states. [2019-09-08 10:34:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50483 states to 50483 states and 67206 transitions. [2019-09-08 10:34:51,767 INFO L78 Accepts]: Start accepts. Automaton has 50483 states and 67206 transitions. Word has length 78 [2019-09-08 10:34:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:51,768 INFO L475 AbstractCegarLoop]: Abstraction has 50483 states and 67206 transitions. [2019-09-08 10:34:51,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 50483 states and 67206 transitions. [2019-09-08 10:34:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:34:51,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:51,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:34:51,772 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:51,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1157971312, now seen corresponding path program 1 times [2019-09-08 10:34:51,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:51,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:51,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:51,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:51,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:51,852 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 10:34:51,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:51,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:51,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:51,854 INFO L87 Difference]: Start difference. First operand 50483 states and 67206 transitions. Second operand 5 states. [2019-09-08 10:35:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:26,517 INFO L93 Difference]: Finished difference Result 205833 states and 273103 transitions. [2019-09-08 10:35:26,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:35:26,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 10:35:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:26,750 INFO L225 Difference]: With dead ends: 205833 [2019-09-08 10:35:26,751 INFO L226 Difference]: Without dead ends: 156014 [2019-09-08 10:35:26,802 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 10:35:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156014 states. [2019-09-08 10:35:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156014 to 101594. [2019-09-08 10:35:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101594 states. [2019-09-08 10:35:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101594 states to 101594 states and 134264 transitions. [2019-09-08 10:35:49,873 INFO L78 Accepts]: Start accepts. Automaton has 101594 states and 134264 transitions. Word has length 81 [2019-09-08 10:35:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:49,873 INFO L475 AbstractCegarLoop]: Abstraction has 101594 states and 134264 transitions. [2019-09-08 10:35:49,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:35:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 101594 states and 134264 transitions. [2019-09-08 10:35:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:35:49,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:49,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:35:49,878 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2119187877, now seen corresponding path program 1 times [2019-09-08 10:35:49,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:49,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:49,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:49,950 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 10:35:49,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:49,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:49,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:49,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:49,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:49,952 INFO L87 Difference]: Start difference. First operand 101594 states and 134264 transitions. Second operand 3 states. [2019-09-08 10:36:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:10,963 INFO L93 Difference]: Finished difference Result 199931 states and 263469 transitions. [2019-09-08 10:36:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:10,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 10:36:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:11,107 INFO L225 Difference]: With dead ends: 199931 [2019-09-08 10:36:11,107 INFO L226 Difference]: Without dead ends: 99009 [2019-09-08 10:36:11,172 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 10:36:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99009 states. [2019-09-08 10:36:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99009 to 81617. [2019-09-08 10:36:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81617 states. [2019-09-08 10:36:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81617 states to 81617 states and 105798 transitions. [2019-09-08 10:36:30,519 INFO L78 Accepts]: Start accepts. Automaton has 81617 states and 105798 transitions. Word has length 83 [2019-09-08 10:36:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:30,519 INFO L475 AbstractCegarLoop]: Abstraction has 81617 states and 105798 transitions. [2019-09-08 10:36:30,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 81617 states and 105798 transitions. [2019-09-08 10:36:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 10:36:30,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:30,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:36:30,524 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1400576218, now seen corresponding path program 1 times [2019-09-08 10:36:30,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:30,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:30,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:30,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:30,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:30,609 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 10:36:30,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:30,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:30,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:30,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:30,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:30,610 INFO L87 Difference]: Start difference. First operand 81617 states and 105798 transitions. Second operand 3 states. [2019-09-08 10:36:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:52,079 INFO L93 Difference]: Finished difference Result 179404 states and 232313 transitions. [2019-09-08 10:36:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:52,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 10:36:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:52,203 INFO L225 Difference]: With dead ends: 179404 [2019-09-08 10:36:52,203 INFO L226 Difference]: Without dead ends: 98427 [2019-09-08 10:36:52,256 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 10:36:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98427 states. [2019-09-08 10:37:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98427 to 93930. [2019-09-08 10:37:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93930 states. [2019-09-08 10:37:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93930 states to 93930 states and 120526 transitions. [2019-09-08 10:37:14,373 INFO L78 Accepts]: Start accepts. Automaton has 93930 states and 120526 transitions. Word has length 86 [2019-09-08 10:37:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:14,373 INFO L475 AbstractCegarLoop]: Abstraction has 93930 states and 120526 transitions. [2019-09-08 10:37:14,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 93930 states and 120526 transitions. [2019-09-08 10:37:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 10:37:14,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:14,382 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:37:14,382 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash 213751766, now seen corresponding path program 1 times [2019-09-08 10:37:14,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:14,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:37:14,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:14,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:14,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:14,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:14,474 INFO L87 Difference]: Start difference. First operand 93930 states and 120526 transitions. Second operand 3 states. [2019-09-08 10:37:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:53,779 INFO L93 Difference]: Finished difference Result 262060 states and 334426 transitions. [2019-09-08 10:37:53,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:53,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 10:37:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:54,196 INFO L225 Difference]: With dead ends: 262060 [2019-09-08 10:37:54,197 INFO L226 Difference]: Without dead ends: 168770 [2019-09-08 10:37:54,272 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 10:37:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168770 states. [2019-09-08 10:38:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168770 to 148961. [2019-09-08 10:38:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148961 states. [2019-09-08 10:38:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148961 states to 148961 states and 187408 transitions. [2019-09-08 10:38:30,669 INFO L78 Accepts]: Start accepts. Automaton has 148961 states and 187408 transitions. Word has length 94 [2019-09-08 10:38:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:30,669 INFO L475 AbstractCegarLoop]: Abstraction has 148961 states and 187408 transitions. [2019-09-08 10:38:30,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:38:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 148961 states and 187408 transitions. [2019-09-08 10:38:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:38:30,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:30,678 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:38:30,679 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash -383116103, now seen corresponding path program 1 times [2019-09-08 10:38:30,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:30,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:30,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:30,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:30,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:38:30,839 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 10:38:30,863 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 10:38:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:31,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 10:38:31,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:38:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:38:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:38:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 10:38:31,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:38:31,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:38:31,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:38:31,914 INFO L87 Difference]: Start difference. First operand 148961 states and 187408 transitions. Second operand 13 states. [2019-09-08 10:40:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:08,761 INFO L93 Difference]: Finished difference Result 500953 states and 631211 transitions. [2019-09-08 10:40:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:40:08,761 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-08 10:40:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:09,848 INFO L225 Difference]: With dead ends: 500953 [2019-09-08 10:40:09,849 INFO L226 Difference]: Without dead ends: 352632 [2019-09-08 10:40:10,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=400, Invalid=1160, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:40:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352632 states. [2019-09-08 10:41:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352632 to 193350. [2019-09-08 10:41:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193350 states. [2019-09-08 10:41:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193350 states to 193350 states and 243070 transitions. [2019-09-08 10:41:04,994 INFO L78 Accepts]: Start accepts. Automaton has 193350 states and 243070 transitions. Word has length 97 [2019-09-08 10:41:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:04,994 INFO L475 AbstractCegarLoop]: Abstraction has 193350 states and 243070 transitions. [2019-09-08 10:41:04,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:41:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 193350 states and 243070 transitions. [2019-09-08 10:41:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:41:05,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:05,020 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:05,020 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2107665468, now seen corresponding path program 1 times [2019-09-08 10:41:05,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:05,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:05,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:05,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:05,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:05,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:05,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:05,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:05,125 INFO L87 Difference]: Start difference. First operand 193350 states and 243070 transitions. Second operand 3 states. [2019-09-08 10:41:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:47,418 INFO L93 Difference]: Finished difference Result 242322 states and 303848 transitions. [2019-09-08 10:41:47,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:47,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 10:41:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:47,701 INFO L225 Difference]: With dead ends: 242322 [2019-09-08 10:41:47,701 INFO L226 Difference]: Without dead ends: 146920 [2019-09-08 10:41:47,806 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 10:41:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146920 states. [2019-09-08 10:42:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146920 to 146726. [2019-09-08 10:42:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146726 states. [2019-09-08 10:42:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146726 states to 146726 states and 181995 transitions. [2019-09-08 10:42:25,769 INFO L78 Accepts]: Start accepts. Automaton has 146726 states and 181995 transitions. Word has length 98 [2019-09-08 10:42:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:25,770 INFO L475 AbstractCegarLoop]: Abstraction has 146726 states and 181995 transitions. [2019-09-08 10:42:25,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:42:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 146726 states and 181995 transitions. [2019-09-08 10:42:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:42:25,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:25,779 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:25,780 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1350911043, now seen corresponding path program 1 times [2019-09-08 10:42:25,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:25,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:25,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:25,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:42:25,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:42:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:42:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:42:25,883 INFO L87 Difference]: Start difference. First operand 146726 states and 181995 transitions. Second operand 5 states. [2019-09-08 10:43:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:17,043 INFO L93 Difference]: Finished difference Result 317388 states and 394009 transitions. [2019-09-08 10:43:17,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:43:17,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 10:43:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:17,382 INFO L225 Difference]: With dead ends: 317388 [2019-09-08 10:43:17,383 INFO L226 Difference]: Without dead ends: 171549 [2019-09-08 10:43:17,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 10:43:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171549 states. [2019-09-08 10:43:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171549 to 142203. [2019-09-08 10:43:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142203 states. [2019-09-08 10:43:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142203 states to 142203 states and 174134 transitions. [2019-09-08 10:43:55,285 INFO L78 Accepts]: Start accepts. Automaton has 142203 states and 174134 transitions. Word has length 99 [2019-09-08 10:43:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:55,285 INFO L475 AbstractCegarLoop]: Abstraction has 142203 states and 174134 transitions. [2019-09-08 10:43:55,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:43:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 142203 states and 174134 transitions. [2019-09-08 10:43:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 10:43:55,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:55,297 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:55,297 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1499550427, now seen corresponding path program 1 times [2019-09-08 10:43:55,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:55,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:55,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 10:43:55,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:55,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:43:55,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:43:55,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:43:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:43:55,388 INFO L87 Difference]: Start difference. First operand 142203 states and 174134 transitions. Second operand 3 states. [2019-09-08 10:44:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:35,567 INFO L93 Difference]: Finished difference Result 187303 states and 229264 transitions. [2019-09-08 10:44:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:35,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 10:44:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:35,771 INFO L225 Difference]: With dead ends: 187303 [2019-09-08 10:44:35,771 INFO L226 Difference]: Without dead ends: 142059 [2019-09-08 10:44:35,824 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 10:44:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142059 states.