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.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:27:01,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:27:01,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:27:01,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:27:01,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:27:01,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:27:01,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:27:01,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:27:01,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:27:01,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:27:01,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:27:01,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:27:01,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:27:01,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:27:01,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:27:01,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:27:01,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:27:01,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:27:01,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:27:01,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:27:01,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:27:01,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:27:01,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:27:01,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:27:01,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:27:01,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:27:01,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:27:01,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:27:01,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:27:01,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:27:01,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:27:01,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:27:01,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:27:01,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:27:01,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:27:01,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:27:01,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:27:01,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:27:01,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:27:01,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:27:01,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:27:01,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:27:01,154 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:27:01,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:27:01,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:27:01,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:27:01,157 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:27:01,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:27:01,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:27:01,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:27:01,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:27:01,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:27:01,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:27:01,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:27:01,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:27:01,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:27:01,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:27:01,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:27:01,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:27:01,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:27:01,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:27:01,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:27:01,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:27:01,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:27:01,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:27:01,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:27:01,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:27:01,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:27:01,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:27:01,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:27:01,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:27:01,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:27:01,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:27:01,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:27:01,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:27:01,247 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:27:01,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 11:27:01,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe6f9b52/3635ded86b4843ddb9d645cc9979012d/FLAGb36574de4 [2019-09-08 11:27:01,801 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:27:01,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 11:27:01,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe6f9b52/3635ded86b4843ddb9d645cc9979012d/FLAGb36574de4 [2019-09-08 11:27:02,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe6f9b52/3635ded86b4843ddb9d645cc9979012d [2019-09-08 11:27:02,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:27:02,148 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:27:02,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:27:02,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:27:02,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:27:02,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:02,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c541725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02, skipping insertion in model container [2019-09-08 11:27:02,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:02,163 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:27:02,230 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:27:02,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:27:02,744 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:27:02,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:27:02,931 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:27:02,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02 WrapperNode [2019-09-08 11:27:02,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:27:02,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:27:02,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:27:02,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:27:02,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:02,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:02,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:02,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:02,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:03,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:03,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... [2019-09-08 11:27:03,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:27:03,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:27:03,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:27:03,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:27:03,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:27:03,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:27:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:27:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:27:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:27:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:27:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:27:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:27:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:27:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:27:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:27:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:27:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:27:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:27:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:27:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:27:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:27:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:27:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:27:04,321 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:27:04,321 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:27:04,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:27:04 BoogieIcfgContainer [2019-09-08 11:27:04,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:27:04,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:27:04,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:27:04,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:27:04,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:27:02" (1/3) ... [2019-09-08 11:27:04,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395f269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:27:04, skipping insertion in model container [2019-09-08 11:27:04,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:27:02" (2/3) ... [2019-09-08 11:27:04,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395f269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:27:04, skipping insertion in model container [2019-09-08 11:27:04,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:27:04" (3/3) ... [2019-09-08 11:27:04,332 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 11:27:04,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:27:04,351 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-08 11:27:04,368 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-08 11:27:04,419 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:27:04,420 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:27:04,420 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:27:04,420 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:27:04,421 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:27:04,421 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:27:04,421 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:27:04,421 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:27:04,421 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:27:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2019-09-08 11:27:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-08 11:27:04,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:04,458 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] [2019-09-08 11:27:04,460 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1048414333, now seen corresponding path program 1 times [2019-09-08 11:27:04,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:04,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:04,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:04,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:04,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:04,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:27:04,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:27:04,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:27:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:27:04,932 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 5 states. [2019-09-08 11:27:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:05,323 INFO L93 Difference]: Finished difference Result 431 states and 714 transitions. [2019-09-08 11:27:05,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:27:05,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-08 11:27:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:05,344 INFO L225 Difference]: With dead ends: 431 [2019-09-08 11:27:05,345 INFO L226 Difference]: Without dead ends: 263 [2019-09-08 11:27:05,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-08 11:27:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2019-09-08 11:27:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-08 11:27:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2019-09-08 11:27:05,418 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 51 [2019-09-08 11:27:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:05,418 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2019-09-08 11:27:05,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:27:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2019-09-08 11:27:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 11:27:05,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:05,422 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] [2019-09-08 11:27:05,422 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash 314314412, now seen corresponding path program 1 times [2019-09-08 11:27:05,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:05,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:05,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:05,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:27:05,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:27:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:27:05,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:27:05,574 INFO L87 Difference]: Start difference. First operand 239 states and 310 transitions. Second operand 5 states. [2019-09-08 11:27:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:05,781 INFO L93 Difference]: Finished difference Result 422 states and 561 transitions. [2019-09-08 11:27:05,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:27:05,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-08 11:27:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:05,784 INFO L225 Difference]: With dead ends: 422 [2019-09-08 11:27:05,784 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 11:27:05,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 11:27:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-09-08 11:27:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-08 11:27:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2019-09-08 11:27:05,810 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 52 [2019-09-08 11:27:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:05,811 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2019-09-08 11:27:05,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:27:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2019-09-08 11:27:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 11:27:05,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:05,814 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] [2019-09-08 11:27:05,815 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1548947995, now seen corresponding path program 1 times [2019-09-08 11:27:05,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:05,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:05,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:05,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:05,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:27:05,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:27:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:27:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:27:05,951 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand 5 states. [2019-09-08 11:27:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:06,113 INFO L93 Difference]: Finished difference Result 412 states and 545 transitions. [2019-09-08 11:27:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:27:06,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-08 11:27:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:06,121 INFO L225 Difference]: With dead ends: 412 [2019-09-08 11:27:06,121 INFO L226 Difference]: Without dead ends: 221 [2019-09-08 11:27:06,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-08 11:27:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-09-08 11:27:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:27:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 285 transitions. [2019-09-08 11:27:06,156 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 285 transitions. Word has length 53 [2019-09-08 11:27:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:06,157 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 285 transitions. [2019-09-08 11:27:06,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:27:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 285 transitions. [2019-09-08 11:27:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 11:27:06,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:06,162 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] [2019-09-08 11:27:06,162 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:06,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:06,163 INFO L82 PathProgramCache]: Analyzing trace with hash -911204178, now seen corresponding path program 1 times [2019-09-08 11:27:06,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:06,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:06,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:06,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:06,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:06,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:06,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:27:06,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:27:06,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:27:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:27:06,381 INFO L87 Difference]: Start difference. First operand 221 states and 285 transitions. Second operand 9 states. [2019-09-08 11:27:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:07,156 INFO L93 Difference]: Finished difference Result 536 states and 732 transitions. [2019-09-08 11:27:07,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:27:07,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-08 11:27:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:07,160 INFO L225 Difference]: With dead ends: 536 [2019-09-08 11:27:07,160 INFO L226 Difference]: Without dead ends: 531 [2019-09-08 11:27:07,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:27:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-08 11:27:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 221. [2019-09-08 11:27:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:27:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2019-09-08 11:27:07,178 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 54 [2019-09-08 11:27:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:07,179 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2019-09-08 11:27:07,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:27:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2019-09-08 11:27:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 11:27:07,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:07,181 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] [2019-09-08 11:27:07,182 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1468636978, now seen corresponding path program 1 times [2019-09-08 11:27:07,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:07,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:07,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:07,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:07,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:27:07,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:27:07,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:27:07,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:27:07,326 INFO L87 Difference]: Start difference. First operand 221 states and 284 transitions. Second operand 9 states. [2019-09-08 11:27:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:08,131 INFO L93 Difference]: Finished difference Result 628 states and 865 transitions. [2019-09-08 11:27:08,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:27:08,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-08 11:27:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:08,135 INFO L225 Difference]: With dead ends: 628 [2019-09-08 11:27:08,135 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 11:27:08,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:27:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 11:27:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 221. [2019-09-08 11:27:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:27:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 283 transitions. [2019-09-08 11:27:08,154 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 283 transitions. Word has length 54 [2019-09-08 11:27:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:08,154 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 283 transitions. [2019-09-08 11:27:08,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:27:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 283 transitions. [2019-09-08 11:27:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 11:27:08,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:08,156 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] [2019-09-08 11:27:08,157 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 52430183, now seen corresponding path program 1 times [2019-09-08 11:27:08,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:08,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:08,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:08,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:27:08,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:27:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:27:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:27:08,283 INFO L87 Difference]: Start difference. First operand 221 states and 283 transitions. Second operand 8 states. [2019-09-08 11:27:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:08,650 INFO L93 Difference]: Finished difference Result 465 states and 614 transitions. [2019-09-08 11:27:08,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:27:08,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-09-08 11:27:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:08,654 INFO L225 Difference]: With dead ends: 465 [2019-09-08 11:27:08,654 INFO L226 Difference]: Without dead ends: 341 [2019-09-08 11:27:08,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:27:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-08 11:27:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 221. [2019-09-08 11:27:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:27:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 282 transitions. [2019-09-08 11:27:08,673 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 282 transitions. Word has length 54 [2019-09-08 11:27:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:08,673 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 282 transitions. [2019-09-08 11:27:08,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:27:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 282 transitions. [2019-09-08 11:27:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:27:08,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:08,675 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 11:27:08,675 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:08,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1510346154, now seen corresponding path program 1 times [2019-09-08 11:27:08,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:08,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:08,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:08,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:08,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:09,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:27:09,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:27:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:27:09,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:27:09,519 INFO L87 Difference]: Start difference. First operand 221 states and 282 transitions. Second operand 16 states. [2019-09-08 11:27:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:11,075 INFO L93 Difference]: Finished difference Result 392 states and 500 transitions. [2019-09-08 11:27:11,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:27:11,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-08 11:27:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:11,078 INFO L225 Difference]: With dead ends: 392 [2019-09-08 11:27:11,079 INFO L226 Difference]: Without dead ends: 388 [2019-09-08 11:27:11,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-08 11:27:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-08 11:27:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 225. [2019-09-08 11:27:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 11:27:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2019-09-08 11:27:11,124 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 56 [2019-09-08 11:27:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:11,124 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2019-09-08 11:27:11,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:27:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2019-09-08 11:27:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 11:27:11,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:11,126 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 11:27:11,126 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:11,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1148696630, now seen corresponding path program 1 times [2019-09-08 11:27:11,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:11,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:11,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:11,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:11,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:11,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:27:11,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:27:11,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:27:11,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:27:11,737 INFO L87 Difference]: Start difference. First operand 225 states and 288 transitions. Second operand 15 states. [2019-09-08 11:27:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:13,158 INFO L93 Difference]: Finished difference Result 462 states and 630 transitions. [2019-09-08 11:27:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:27:13,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-09-08 11:27:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:13,161 INFO L225 Difference]: With dead ends: 462 [2019-09-08 11:27:13,161 INFO L226 Difference]: Without dead ends: 349 [2019-09-08 11:27:13,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:27:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-08 11:27:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2019-09-08 11:27:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 11:27:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 274 transitions. [2019-09-08 11:27:13,183 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 274 transitions. Word has length 56 [2019-09-08 11:27:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:13,184 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 274 transitions. [2019-09-08 11:27:13,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:27:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 274 transitions. [2019-09-08 11:27:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:27:13,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:13,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:13,185 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:13,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:13,186 INFO L82 PathProgramCache]: Analyzing trace with hash 129284665, now seen corresponding path program 1 times [2019-09-08 11:27:13,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:13,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:13,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:13,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:27:13,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:27:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:27:13,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:27:13,335 INFO L87 Difference]: Start difference. First operand 214 states and 274 transitions. Second operand 9 states. [2019-09-08 11:27:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:14,082 INFO L93 Difference]: Finished difference Result 550 states and 761 transitions. [2019-09-08 11:27:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:27:14,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-08 11:27:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:14,085 INFO L225 Difference]: With dead ends: 550 [2019-09-08 11:27:14,085 INFO L226 Difference]: Without dead ends: 436 [2019-09-08 11:27:14,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:27:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-08 11:27:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 214. [2019-09-08 11:27:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 11:27:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2019-09-08 11:27:14,109 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 57 [2019-09-08 11:27:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:14,109 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2019-09-08 11:27:14,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:27:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2019-09-08 11:27:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:27:14,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:14,110 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 11:27:14,111 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:14,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1929422544, now seen corresponding path program 1 times [2019-09-08 11:27:14,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:14,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:14,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:14,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:14,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:14,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:14,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:27:14,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:27:14,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:27:14,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:27:14,231 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand 9 states. [2019-09-08 11:27:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:14,746 INFO L93 Difference]: Finished difference Result 341 states and 445 transitions. [2019-09-08 11:27:14,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:27:14,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-08 11:27:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:14,749 INFO L225 Difference]: With dead ends: 341 [2019-09-08 11:27:14,749 INFO L226 Difference]: Without dead ends: 334 [2019-09-08 11:27:14,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:27:14,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-08 11:27:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 214. [2019-09-08 11:27:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 11:27:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2019-09-08 11:27:14,772 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 57 [2019-09-08 11:27:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:14,772 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2019-09-08 11:27:14,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:27:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2019-09-08 11:27:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:27:14,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:14,774 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 11:27:14,774 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1236153109, now seen corresponding path program 1 times [2019-09-08 11:27:14,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:14,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:14,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:14,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:14,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:15,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:15,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:27:15,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:27:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:27:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:27:15,299 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand 13 states. [2019-09-08 11:27:15,754 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-08 11:27:15,887 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-08 11:27:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:16,437 INFO L93 Difference]: Finished difference Result 668 states and 937 transitions. [2019-09-08 11:27:16,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:27:16,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-09-08 11:27:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:16,442 INFO L225 Difference]: With dead ends: 668 [2019-09-08 11:27:16,442 INFO L226 Difference]: Without dead ends: 648 [2019-09-08 11:27:16,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:27:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-08 11:27:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 194. [2019-09-08 11:27:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-08 11:27:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2019-09-08 11:27:16,477 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 57 [2019-09-08 11:27:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:16,477 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2019-09-08 11:27:16,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:27:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2019-09-08 11:27:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 11:27:16,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:16,479 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 11:27:16,479 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1017147876, now seen corresponding path program 1 times [2019-09-08 11:27:16,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:16,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:16,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:16,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:16,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:27:16,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:27:16,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:27:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:27:16,972 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 12 states. [2019-09-08 11:27:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:17,760 INFO L93 Difference]: Finished difference Result 486 states and 669 transitions. [2019-09-08 11:27:17,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:27:17,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-08 11:27:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:17,763 INFO L225 Difference]: With dead ends: 486 [2019-09-08 11:27:17,763 INFO L226 Difference]: Without dead ends: 398 [2019-09-08 11:27:17,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:27:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-08 11:27:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 190. [2019-09-08 11:27:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-08 11:27:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 242 transitions. [2019-09-08 11:27:17,793 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 242 transitions. Word has length 57 [2019-09-08 11:27:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:17,793 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 242 transitions. [2019-09-08 11:27:17,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:27:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 242 transitions. [2019-09-08 11:27:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 11:27:17,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:17,795 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] [2019-09-08 11:27:17,795 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1774022695, now seen corresponding path program 1 times [2019-09-08 11:27:17,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:17,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:18,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:18,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:27:18,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:27:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:27:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:27:18,050 INFO L87 Difference]: Start difference. First operand 190 states and 242 transitions. Second operand 10 states. [2019-09-08 11:27:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:19,057 INFO L93 Difference]: Finished difference Result 399 states and 539 transitions. [2019-09-08 11:27:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:27:19,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-08 11:27:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:19,060 INFO L225 Difference]: With dead ends: 399 [2019-09-08 11:27:19,060 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 11:27:19,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:27:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 11:27:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 190. [2019-09-08 11:27:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-08 11:27:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2019-09-08 11:27:19,088 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 58 [2019-09-08 11:27:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:19,088 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2019-09-08 11:27:19,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:27:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2019-09-08 11:27:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 11:27:19,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:19,089 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 11:27:19,090 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 334190176, now seen corresponding path program 1 times [2019-09-08 11:27:19,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:19,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:19,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:19,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:19,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 11:27:19,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 11:27:19,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 11:27:19,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:27:19,511 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand 18 states. [2019-09-08 11:27:19,645 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:27:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:21,101 INFO L93 Difference]: Finished difference Result 392 states and 528 transitions. [2019-09-08 11:27:21,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:27:21,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-09-08 11:27:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:21,104 INFO L225 Difference]: With dead ends: 392 [2019-09-08 11:27:21,104 INFO L226 Difference]: Without dead ends: 386 [2019-09-08 11:27:21,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:27:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-08 11:27:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 196. [2019-09-08 11:27:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-08 11:27:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 249 transitions. [2019-09-08 11:27:21,135 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 249 transitions. Word has length 59 [2019-09-08 11:27:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:21,135 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 249 transitions. [2019-09-08 11:27:21,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 11:27:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2019-09-08 11:27:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:27:21,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:21,136 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 11:27:21,137 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash 514928378, now seen corresponding path program 1 times [2019-09-08 11:27:21,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:21,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:21,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:21,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:21,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:22,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:22,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 11:27:22,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:27:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:27:22,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:27:22,246 INFO L87 Difference]: Start difference. First operand 196 states and 249 transitions. Second operand 19 states. [2019-09-08 11:27:22,998 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-08 11:27:23,179 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:27:23,344 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:27:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:24,491 INFO L93 Difference]: Finished difference Result 397 states and 532 transitions. [2019-09-08 11:27:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:27:24,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-09-08 11:27:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:24,494 INFO L225 Difference]: With dead ends: 397 [2019-09-08 11:27:24,494 INFO L226 Difference]: Without dead ends: 391 [2019-09-08 11:27:24,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:27:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-08 11:27:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 190. [2019-09-08 11:27:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-08 11:27:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 240 transitions. [2019-09-08 11:27:24,521 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 240 transitions. Word has length 60 [2019-09-08 11:27:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:24,521 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 240 transitions. [2019-09-08 11:27:24,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:27:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 240 transitions. [2019-09-08 11:27:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:27:24,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:24,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, 1] [2019-09-08 11:27:24,523 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:24,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1498365057, now seen corresponding path program 1 times [2019-09-08 11:27:24,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:24,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:24,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:27:24,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:27:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:27:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:27:24,864 INFO L87 Difference]: Start difference. First operand 190 states and 240 transitions. Second operand 12 states. [2019-09-08 11:27:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:25,837 INFO L93 Difference]: Finished difference Result 496 states and 677 transitions. [2019-09-08 11:27:25,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:27:25,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-09-08 11:27:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:25,841 INFO L225 Difference]: With dead ends: 496 [2019-09-08 11:27:25,841 INFO L226 Difference]: Without dead ends: 490 [2019-09-08 11:27:25,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:27:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-08 11:27:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 184. [2019-09-08 11:27:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-08 11:27:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2019-09-08 11:27:25,874 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 60 [2019-09-08 11:27:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:25,875 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2019-09-08 11:27:25,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:27:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2019-09-08 11:27:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 11:27:25,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:25,876 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 11:27:25,876 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1413076030, now seen corresponding path program 1 times [2019-09-08 11:27:25,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:25,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:26,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:26,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 11:27:26,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 11:27:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 11:27:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:27:26,754 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand 18 states. [2019-09-08 11:27:27,340 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-08 11:27:27,485 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 11:27:27,637 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 11:27:27,799 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 11:27:27,948 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 11:27:28,129 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:27:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:28,756 INFO L93 Difference]: Finished difference Result 192 states and 241 transitions. [2019-09-08 11:27:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:27:28,757 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-09-08 11:27:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:28,758 INFO L225 Difference]: With dead ends: 192 [2019-09-08 11:27:28,758 INFO L226 Difference]: Without dead ends: 184 [2019-09-08 11:27:28,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:27:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-08 11:27:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-09-08 11:27:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-08 11:27:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 233 transitions. [2019-09-08 11:27:28,791 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 233 transitions. Word has length 60 [2019-09-08 11:27:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:28,791 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 233 transitions. [2019-09-08 11:27:28,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 11:27:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2019-09-08 11:27:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 11:27:28,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:28,793 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 11:27:28,793 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1314143621, now seen corresponding path program 1 times [2019-09-08 11:27:28,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:28,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:28,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:28,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:28,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:29,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:29,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:27:29,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:27:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:27:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:27:29,173 INFO L87 Difference]: Start difference. First operand 184 states and 233 transitions. Second operand 11 states. [2019-09-08 11:27:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:30,278 INFO L93 Difference]: Finished difference Result 704 states and 1005 transitions. [2019-09-08 11:27:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:27:30,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-09-08 11:27:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:30,282 INFO L225 Difference]: With dead ends: 704 [2019-09-08 11:27:30,282 INFO L226 Difference]: Without dead ends: 686 [2019-09-08 11:27:30,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:27:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-08 11:27:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 166. [2019-09-08 11:27:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-08 11:27:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2019-09-08 11:27:30,316 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 61 [2019-09-08 11:27:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:30,317 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2019-09-08 11:27:30,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:27:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2019-09-08 11:27:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:27:30,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:30,318 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 11:27:30,318 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1247665849, now seen corresponding path program 1 times [2019-09-08 11:27:30,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:30,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:30,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:30,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:30,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:30,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:30,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:30,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:30,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:30,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:30,378 INFO L87 Difference]: Start difference. First operand 166 states and 215 transitions. Second operand 3 states. [2019-09-08 11:27:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:30,452 INFO L93 Difference]: Finished difference Result 326 states and 451 transitions. [2019-09-08 11:27:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:30,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:27:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:30,454 INFO L225 Difference]: With dead ends: 326 [2019-09-08 11:27:30,454 INFO L226 Difference]: Without dead ends: 242 [2019-09-08 11:27:30,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-08 11:27:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-08 11:27:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 11:27:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 322 transitions. [2019-09-08 11:27:30,511 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 322 transitions. Word has length 77 [2019-09-08 11:27:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:30,511 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 322 transitions. [2019-09-08 11:27:30,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 322 transitions. [2019-09-08 11:27:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:27:30,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:30,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:30,513 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -574990682, now seen corresponding path program 1 times [2019-09-08 11:27:30,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:30,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:30,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:30,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:30,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:27:30,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:27:30,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:27:30,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:30,591 INFO L87 Difference]: Start difference. First operand 240 states and 322 transitions. Second operand 7 states. [2019-09-08 11:27:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:30,961 INFO L93 Difference]: Finished difference Result 728 states and 1026 transitions. [2019-09-08 11:27:30,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:27:30,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-08 11:27:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:30,965 INFO L225 Difference]: With dead ends: 728 [2019-09-08 11:27:30,965 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 11:27:30,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:27:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 11:27:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 292. [2019-09-08 11:27:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-08 11:27:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 396 transitions. [2019-09-08 11:27:31,038 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 396 transitions. Word has length 79 [2019-09-08 11:27:31,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:31,038 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 396 transitions. [2019-09-08 11:27:31,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:27:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 396 transitions. [2019-09-08 11:27:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:27:31,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:31,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:31,040 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1123393510, now seen corresponding path program 1 times [2019-09-08 11:27:31,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:31,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:31,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:31,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:31,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:31,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:31,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:27:31,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:27:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:27:31,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:31,159 INFO L87 Difference]: Start difference. First operand 292 states and 396 transitions. Second operand 7 states. [2019-09-08 11:27:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:31,624 INFO L93 Difference]: Finished difference Result 1044 states and 1476 transitions. [2019-09-08 11:27:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:27:31,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-08 11:27:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:31,628 INFO L225 Difference]: With dead ends: 1044 [2019-09-08 11:27:31,629 INFO L226 Difference]: Without dead ends: 834 [2019-09-08 11:27:31,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:27:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-09-08 11:27:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 540. [2019-09-08 11:27:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-08 11:27:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 758 transitions. [2019-09-08 11:27:31,735 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 758 transitions. Word has length 79 [2019-09-08 11:27:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:31,736 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 758 transitions. [2019-09-08 11:27:31,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:27:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 758 transitions. [2019-09-08 11:27:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:27:31,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:31,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:31,737 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:31,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:31,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1884477720, now seen corresponding path program 1 times [2019-09-08 11:27:31,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:31,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:31,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:31,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:31,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:31,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:31,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:31,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:31,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:31,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:31,790 INFO L87 Difference]: Start difference. First operand 540 states and 758 transitions. Second operand 3 states. [2019-09-08 11:27:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:32,082 INFO L93 Difference]: Finished difference Result 1392 states and 1984 transitions. [2019-09-08 11:27:32,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:32,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:27:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:32,087 INFO L225 Difference]: With dead ends: 1392 [2019-09-08 11:27:32,087 INFO L226 Difference]: Without dead ends: 934 [2019-09-08 11:27:32,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-09-08 11:27:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 932. [2019-09-08 11:27:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2019-09-08 11:27:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1298 transitions. [2019-09-08 11:27:32,354 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1298 transitions. Word has length 79 [2019-09-08 11:27:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:32,354 INFO L475 AbstractCegarLoop]: Abstraction has 932 states and 1298 transitions. [2019-09-08 11:27:32,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1298 transitions. [2019-09-08 11:27:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:27:32,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:32,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:32,356 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737399, now seen corresponding path program 1 times [2019-09-08 11:27:32,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:32,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:32,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:32,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:32,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:32,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:32,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:32,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:32,408 INFO L87 Difference]: Start difference. First operand 932 states and 1298 transitions. Second operand 3 states. [2019-09-08 11:27:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:32,816 INFO L93 Difference]: Finished difference Result 2224 states and 3128 transitions. [2019-09-08 11:27:32,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:32,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:27:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:32,822 INFO L225 Difference]: With dead ends: 2224 [2019-09-08 11:27:32,822 INFO L226 Difference]: Without dead ends: 1374 [2019-09-08 11:27:32,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-09-08 11:27:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2019-09-08 11:27:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-08 11:27:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1902 transitions. [2019-09-08 11:27:33,173 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1902 transitions. Word has length 79 [2019-09-08 11:27:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:33,173 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1902 transitions. [2019-09-08 11:27:33,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1902 transitions. [2019-09-08 11:27:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:27:33,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:33,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:33,174 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:33,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1854658784, now seen corresponding path program 1 times [2019-09-08 11:27:33,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:33,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:33,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:33,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:33,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:33,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:33,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:27:33,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:27:33,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:27:33,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:33,255 INFO L87 Difference]: Start difference. First operand 1372 states and 1902 transitions. Second operand 7 states. [2019-09-08 11:27:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:34,293 INFO L93 Difference]: Finished difference Result 5044 states and 7063 transitions. [2019-09-08 11:27:34,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:27:34,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-08 11:27:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:34,306 INFO L225 Difference]: With dead ends: 5044 [2019-09-08 11:27:34,306 INFO L226 Difference]: Without dead ends: 3754 [2019-09-08 11:27:34,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:27:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2019-09-08 11:27:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 2384. [2019-09-08 11:27:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2384 states. [2019-09-08 11:27:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3328 transitions. [2019-09-08 11:27:34,889 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3328 transitions. Word has length 79 [2019-09-08 11:27:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:34,890 INFO L475 AbstractCegarLoop]: Abstraction has 2384 states and 3328 transitions. [2019-09-08 11:27:34,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:27:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3328 transitions. [2019-09-08 11:27:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:27:34,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:34,891 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] [2019-09-08 11:27:34,892 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2127178523, now seen corresponding path program 1 times [2019-09-08 11:27:34,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:34,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:34,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:34,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:34,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:34,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:34,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:34,942 INFO L87 Difference]: Start difference. First operand 2384 states and 3328 transitions. Second operand 3 states. [2019-09-08 11:27:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:35,486 INFO L93 Difference]: Finished difference Result 4478 states and 6252 transitions. [2019-09-08 11:27:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:35,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:27:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:35,493 INFO L225 Difference]: With dead ends: 4478 [2019-09-08 11:27:35,493 INFO L226 Difference]: Without dead ends: 2176 [2019-09-08 11:27:35,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-09-08 11:27:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 1764. [2019-09-08 11:27:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2019-09-08 11:27:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2411 transitions. [2019-09-08 11:27:35,916 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2411 transitions. Word has length 80 [2019-09-08 11:27:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:35,917 INFO L475 AbstractCegarLoop]: Abstraction has 1764 states and 2411 transitions. [2019-09-08 11:27:35,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2411 transitions. [2019-09-08 11:27:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:27:35,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:35,918 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 11:27:35,918 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:35,919 INFO L82 PathProgramCache]: Analyzing trace with hash -582107602, now seen corresponding path program 1 times [2019-09-08 11:27:35,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:35,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:35,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:35,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:35,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:35,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:35,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:35,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:35,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:35,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:35,969 INFO L87 Difference]: Start difference. First operand 1764 states and 2411 transitions. Second operand 3 states. [2019-09-08 11:27:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:36,813 INFO L93 Difference]: Finished difference Result 4144 states and 5675 transitions. [2019-09-08 11:27:36,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:36,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:27:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:36,821 INFO L225 Difference]: With dead ends: 4144 [2019-09-08 11:27:36,821 INFO L226 Difference]: Without dead ends: 2462 [2019-09-08 11:27:36,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-09-08 11:27:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2232. [2019-09-08 11:27:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-09-08 11:27:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3028 transitions. [2019-09-08 11:27:37,358 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3028 transitions. Word has length 81 [2019-09-08 11:27:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:37,358 INFO L475 AbstractCegarLoop]: Abstraction has 2232 states and 3028 transitions. [2019-09-08 11:27:37,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3028 transitions. [2019-09-08 11:27:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:27:37,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:37,359 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] [2019-09-08 11:27:37,360 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:37,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1038081524, now seen corresponding path program 1 times [2019-09-08 11:27:37,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:37,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:37,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:37,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:37,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:37,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:37,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:37,420 INFO L87 Difference]: Start difference. First operand 2232 states and 3028 transitions. Second operand 3 states. [2019-09-08 11:27:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:38,240 INFO L93 Difference]: Finished difference Result 4718 states and 6426 transitions. [2019-09-08 11:27:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:38,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:27:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:38,248 INFO L225 Difference]: With dead ends: 4718 [2019-09-08 11:27:38,248 INFO L226 Difference]: Without dead ends: 2568 [2019-09-08 11:27:38,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-09-08 11:27:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2486. [2019-09-08 11:27:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-09-08 11:27:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3336 transitions. [2019-09-08 11:27:38,876 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3336 transitions. Word has length 82 [2019-09-08 11:27:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:38,877 INFO L475 AbstractCegarLoop]: Abstraction has 2486 states and 3336 transitions. [2019-09-08 11:27:38,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3336 transitions. [2019-09-08 11:27:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:27:38,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:38,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:38,878 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash 339548442, now seen corresponding path program 1 times [2019-09-08 11:27:38,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:38,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:38,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:38,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:38,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:38,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:38,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:38,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:38,925 INFO L87 Difference]: Start difference. First operand 2486 states and 3336 transitions. Second operand 3 states. [2019-09-08 11:27:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:39,694 INFO L93 Difference]: Finished difference Result 5118 states and 6900 transitions. [2019-09-08 11:27:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:39,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 11:27:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:39,704 INFO L225 Difference]: With dead ends: 5118 [2019-09-08 11:27:39,705 INFO L226 Difference]: Without dead ends: 2714 [2019-09-08 11:27:39,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2019-09-08 11:27:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2712. [2019-09-08 11:27:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2712 states. [2019-09-08 11:27:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3620 transitions. [2019-09-08 11:27:40,350 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3620 transitions. Word has length 83 [2019-09-08 11:27:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:40,352 INFO L475 AbstractCegarLoop]: Abstraction has 2712 states and 3620 transitions. [2019-09-08 11:27:40,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3620 transitions. [2019-09-08 11:27:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:27:40,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:40,354 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 11:27:40,354 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1321048598, now seen corresponding path program 1 times [2019-09-08 11:27:40,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:40,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:40,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:40,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:40,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:27:40,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:27:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:27:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:27:40,427 INFO L87 Difference]: Start difference. First operand 2712 states and 3620 transitions. Second operand 6 states. [2019-09-08 11:27:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:41,449 INFO L93 Difference]: Finished difference Result 3878 states and 5134 transitions. [2019-09-08 11:27:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:27:41,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-08 11:27:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:41,468 INFO L225 Difference]: With dead ends: 3878 [2019-09-08 11:27:41,468 INFO L226 Difference]: Without dead ends: 3876 [2019-09-08 11:27:41,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:27:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2019-09-08 11:27:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 2760. [2019-09-08 11:27:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-09-08 11:27:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3652 transitions. [2019-09-08 11:27:42,097 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3652 transitions. Word has length 83 [2019-09-08 11:27:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:42,097 INFO L475 AbstractCegarLoop]: Abstraction has 2760 states and 3652 transitions. [2019-09-08 11:27:42,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:27:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3652 transitions. [2019-09-08 11:27:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:27:42,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:42,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:42,100 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1380496519, now seen corresponding path program 1 times [2019-09-08 11:27:42,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:42,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:42,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:42,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:42,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 11:27:42,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:42,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:27:42,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:27:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:27:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:27:42,195 INFO L87 Difference]: Start difference. First operand 2760 states and 3652 transitions. Second operand 5 states. [2019-09-08 11:27:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:43,348 INFO L93 Difference]: Finished difference Result 7308 states and 9667 transitions. [2019-09-08 11:27:43,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:27:43,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 11:27:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:43,357 INFO L225 Difference]: With dead ends: 7308 [2019-09-08 11:27:43,357 INFO L226 Difference]: Without dead ends: 4630 [2019-09-08 11:27:43,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:27:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2019-09-08 11:27:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 3658. [2019-09-08 11:27:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2019-09-08 11:27:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4844 transitions. [2019-09-08 11:27:44,286 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4844 transitions. Word has length 104 [2019-09-08 11:27:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:44,286 INFO L475 AbstractCegarLoop]: Abstraction has 3658 states and 4844 transitions. [2019-09-08 11:27:44,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:27:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4844 transitions. [2019-09-08 11:27:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:27:44,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:44,292 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:44,292 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1928899347, now seen corresponding path program 1 times [2019-09-08 11:27:44,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:44,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 11:27:44,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:44,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:27:44,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:27:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:27:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:27:44,405 INFO L87 Difference]: Start difference. First operand 3658 states and 4844 transitions. Second operand 5 states. [2019-09-08 11:27:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:46,543 INFO L93 Difference]: Finished difference Result 12582 states and 16628 transitions. [2019-09-08 11:27:46,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:27:46,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 11:27:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:46,570 INFO L225 Difference]: With dead ends: 12582 [2019-09-08 11:27:46,571 INFO L226 Difference]: Without dead ends: 9006 [2019-09-08 11:27:46,580 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 11:27:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9006 states. [2019-09-08 11:27:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9006 to 5422. [2019-09-08 11:27:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-09-08 11:27:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 7148 transitions. [2019-09-08 11:27:48,379 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 7148 transitions. Word has length 104 [2019-09-08 11:27:48,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:48,379 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 7148 transitions. [2019-09-08 11:27:48,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:27:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 7148 transitions. [2019-09-08 11:27:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:27:48,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:48,382 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:48,382 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1634802675, now seen corresponding path program 1 times [2019-09-08 11:27:48,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:48,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:48,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 11:27:48,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:48,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:27:48,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:27:48,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:27:48,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:27:48,458 INFO L87 Difference]: Start difference. First operand 5422 states and 7148 transitions. Second operand 5 states. [2019-09-08 11:27:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:51,158 INFO L93 Difference]: Finished difference Result 14418 states and 19034 transitions. [2019-09-08 11:27:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:27:51,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 11:27:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:51,180 INFO L225 Difference]: With dead ends: 14418 [2019-09-08 11:27:51,180 INFO L226 Difference]: Without dead ends: 10842 [2019-09-08 11:27:51,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:27:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-09-08 11:27:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 8052. [2019-09-08 11:27:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-09-08 11:27:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 10564 transitions. [2019-09-08 11:27:53,375 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 10564 transitions. Word has length 104 [2019-09-08 11:27:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:53,376 INFO L475 AbstractCegarLoop]: Abstraction has 8052 states and 10564 transitions. [2019-09-08 11:27:53,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:27:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 10564 transitions. [2019-09-08 11:27:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:27:53,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:53,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:53,379 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1368665944, now seen corresponding path program 1 times [2019-09-08 11:27:53,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:53,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:53,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 11:27:53,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:27:53,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:27:53,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:27:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:53,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 11:27:53,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:27:53,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:27:53,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:27:53,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:27:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:54,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:27:54,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2019-09-08 11:27:54,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:27:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:27:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:27:54,080 INFO L87 Difference]: Start difference. First operand 8052 states and 10564 transitions. Second operand 14 states. [2019-09-08 11:28:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:13,061 INFO L93 Difference]: Finished difference Result 61272 states and 80332 transitions. [2019-09-08 11:28:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 11:28:13,061 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2019-09-08 11:28:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:13,173 INFO L225 Difference]: With dead ends: 61272 [2019-09-08 11:28:13,174 INFO L226 Difference]: Without dead ends: 53302 [2019-09-08 11:28:13,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=892, Invalid=3800, Unknown=0, NotChecked=0, Total=4692 [2019-09-08 11:28:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53302 states. [2019-09-08 11:28:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53302 to 23029. [2019-09-08 11:28:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23029 states. [2019-09-08 11:28:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 30177 transitions. [2019-09-08 11:28:19,911 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 30177 transitions. Word has length 105 [2019-09-08 11:28:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:19,911 INFO L475 AbstractCegarLoop]: Abstraction has 23029 states and 30177 transitions. [2019-09-08 11:28:19,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:28:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 30177 transitions. [2019-09-08 11:28:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:28:19,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:19,916 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:28:19,917 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash 75351500, now seen corresponding path program 1 times [2019-09-08 11:28:19,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:19,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:19,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 11:28:20,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:20,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:28:20,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:28:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:28:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:28:20,071 INFO L87 Difference]: Start difference. First operand 23029 states and 30177 transitions. Second operand 9 states. [2019-09-08 11:28:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:33,962 INFO L93 Difference]: Finished difference Result 69971 states and 91405 transitions. [2019-09-08 11:28:33,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:28:33,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-08 11:28:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:34,043 INFO L225 Difference]: With dead ends: 69971 [2019-09-08 11:28:34,044 INFO L226 Difference]: Without dead ends: 47022 [2019-09-08 11:28:34,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:28:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47022 states. [2019-09-08 11:28:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47022 to 23029. [2019-09-08 11:28:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23029 states. [2019-09-08 11:28:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 30175 transitions. [2019-09-08 11:28:40,768 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 30175 transitions. Word has length 106 [2019-09-08 11:28:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:40,768 INFO L475 AbstractCegarLoop]: Abstraction has 23029 states and 30175 transitions. [2019-09-08 11:28:40,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:28:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 30175 transitions. [2019-09-08 11:28:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 11:28:40,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:40,772 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:28:40,772 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash 94830107, now seen corresponding path program 1 times [2019-09-08 11:28:40,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:40,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:40,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:40,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:28:41,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:28:41,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:28:41,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:41,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 11:28:41,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:28:41,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:28:41,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:28:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:28:41,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:28:41,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-09-08 11:28:41,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 11:28:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 11:28:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:28:41,759 INFO L87 Difference]: Start difference. First operand 23029 states and 30175 transitions. Second operand 18 states. [2019-09-08 11:28:42,333 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 11:28:42,718 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-08 11:28:42,941 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 11:28:43,150 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-08 11:28:43,728 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-08 11:28:44,140 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 11:28:44,378 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:28:44,644 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 11:28:44,940 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:28:45,243 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 11:28:45,492 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-08 11:28:45,729 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 11:28:45,872 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:28:46,058 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 11:28:46,383 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-08 11:28:46,809 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 11:28:47,630 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-08 11:28:48,145 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-08 11:28:48,413 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-09-08 11:28:48,640 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-08 11:28:49,142 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 11:28:50,887 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:28:51,033 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-08 11:28:51,354 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:28:51,619 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 11:28:51,799 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 11:28:52,066 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-08 11:28:52,634 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-08 11:28:52,805 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-08 11:28:53,191 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-09-08 11:28:53,354 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 11:28:54,164 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 11:28:54,629 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 11:28:54,943 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 11:29:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:20,642 INFO L93 Difference]: Finished difference Result 104278 states and 134151 transitions. [2019-09-08 11:29:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 11:29:20,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 108 [2019-09-08 11:29:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:20,801 INFO L225 Difference]: With dead ends: 104278 [2019-09-08 11:29:20,801 INFO L226 Difference]: Without dead ends: 82410 [2019-09-08 11:29:20,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=924, Invalid=3366, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 11:29:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82410 states. [2019-09-08 11:29:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82410 to 38473. [2019-09-08 11:29:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38473 states. [2019-09-08 11:29:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38473 states to 38473 states and 50085 transitions. [2019-09-08 11:29:33,600 INFO L78 Accepts]: Start accepts. Automaton has 38473 states and 50085 transitions. Word has length 108 [2019-09-08 11:29:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:33,600 INFO L475 AbstractCegarLoop]: Abstraction has 38473 states and 50085 transitions. [2019-09-08 11:29:33,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 11:29:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38473 states and 50085 transitions. [2019-09-08 11:29:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 11:29:33,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:33,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:33,610 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash -636435167, now seen corresponding path program 1 times [2019-09-08 11:29:33,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:33,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:33,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:33,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:33,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:29:33,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:29:33,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:29:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:34,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:29:34,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:29:34,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:29:34,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:29:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:34,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:29:34,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 11:29:34,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:29:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:29:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:29:34,613 INFO L87 Difference]: Start difference. First operand 38473 states and 50085 transitions. Second operand 20 states. [2019-09-08 11:29:35,269 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:29:35,467 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:29:35,998 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:29:36,189 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:36,444 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:29:36,600 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:29:36,962 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:29:37,865 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:38,217 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:38,634 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:29:39,015 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:29:39,404 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:39,652 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:29:39,875 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:29:40,185 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:29:40,448 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:29:40,693 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:29:41,115 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:29:41,651 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:29:41,915 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:29:42,392 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 11:29:48,986 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:29:49,267 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:29:50,252 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:29:50,546 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:29:51,423 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:29:51,647 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:29:51,893 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:29:52,161 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:29:52,405 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:29:52,733 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:29:53,230 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:29:53,453 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:29:53,928 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:29:54,876 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 11:31:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:07,616 INFO L93 Difference]: Finished difference Result 238737 states and 306701 transitions. [2019-09-08 11:31:07,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 11:31:07,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-09-08 11:31:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:07,984 INFO L225 Difference]: With dead ends: 238737 [2019-09-08 11:31:07,984 INFO L226 Difference]: Without dead ends: 200362 [2019-09-08 11:31:08,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=929, Invalid=2493, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 11:31:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200362 states. [2019-09-08 11:31:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200362 to 94821. [2019-09-08 11:31:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94821 states. [2019-09-08 11:31:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94821 states to 94821 states and 123375 transitions. [2019-09-08 11:31:46,915 INFO L78 Accepts]: Start accepts. Automaton has 94821 states and 123375 transitions. Word has length 108 [2019-09-08 11:31:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:31:46,915 INFO L475 AbstractCegarLoop]: Abstraction has 94821 states and 123375 transitions. [2019-09-08 11:31:46,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:31:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 94821 states and 123375 transitions. [2019-09-08 11:31:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 11:31:46,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:31:46,921 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:31:46,921 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:31:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:31:46,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1305569259, now seen corresponding path program 1 times [2019-09-08 11:31:46,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:31:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:31:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:46,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:31:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:31:47,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:31:47,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:31:47,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:31:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:31:47,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 11:31:47,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:31:47,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:31:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:31:47,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:31:47,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 11:31:47,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:31:47,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:31:47,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:31:47,925 INFO L87 Difference]: Start difference. First operand 94821 states and 123375 transitions. Second operand 20 states. [2019-09-08 11:33:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:33:33,223 INFO L93 Difference]: Finished difference Result 269681 states and 348448 transitions. [2019-09-08 11:33:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 11:33:33,223 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-09-08 11:33:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:33:33,528 INFO L225 Difference]: With dead ends: 269681 [2019-09-08 11:33:33,528 INFO L226 Difference]: Without dead ends: 233092 [2019-09-08 11:33:33,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=644, Invalid=1806, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 11:33:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233092 states. [2019-09-08 11:34:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233092 to 97948. [2019-09-08 11:34:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97948 states. [2019-09-08 11:34:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97948 states to 97948 states and 127534 transitions. [2019-09-08 11:34:20,604 INFO L78 Accepts]: Start accepts. Automaton has 97948 states and 127534 transitions. Word has length 108 [2019-09-08 11:34:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:34:20,604 INFO L475 AbstractCegarLoop]: Abstraction has 97948 states and 127534 transitions. [2019-09-08 11:34:20,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:34:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 97948 states and 127534 transitions. [2019-09-08 11:34:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 11:34:20,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:34:20,611 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:34:20,611 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:34:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:34:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash -30315983, now seen corresponding path program 1 times [2019-09-08 11:34:20,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:34:20,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:34:20,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:34:20,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:34:20,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:34:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:34:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 11:34:20,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:34:20,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:34:20,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:34:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:34:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:34:20,658 INFO L87 Difference]: Start difference. First operand 97948 states and 127534 transitions. Second operand 3 states. [2019-09-08 11:34:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:34:56,128 INFO L93 Difference]: Finished difference Result 176458 states and 229805 transitions. [2019-09-08 11:34:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:34:56,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 11:34:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:34:56,219 INFO L225 Difference]: With dead ends: 176458 [2019-09-08 11:34:56,219 INFO L226 Difference]: Without dead ends: 78650 [2019-09-08 11:34:56,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:34:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78650 states. [2019-09-08 11:35:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78650 to 78650. [2019-09-08 11:35:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78650 states. [2019-09-08 11:35:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78650 states to 78650 states and 100622 transitions. [2019-09-08 11:35:29,428 INFO L78 Accepts]: Start accepts. Automaton has 78650 states and 100622 transitions. Word has length 109 [2019-09-08 11:35:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:35:29,428 INFO L475 AbstractCegarLoop]: Abstraction has 78650 states and 100622 transitions. [2019-09-08 11:35:29,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:35:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 78650 states and 100622 transitions. [2019-09-08 11:35:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 11:35:29,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:35:29,433 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:35:29,433 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:35:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:35:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1279232707, now seen corresponding path program 1 times [2019-09-08 11:35:29,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:35:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:35:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:29,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:35:29,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:35:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:35:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:35:29,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:35:29,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:35:29,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:35:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:35:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:35:29,493 INFO L87 Difference]: Start difference. First operand 78650 states and 100622 transitions. Second operand 3 states. [2019-09-08 11:35:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:35:54,596 INFO L93 Difference]: Finished difference Result 130862 states and 165850 transitions. [2019-09-08 11:35:54,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:35:54,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 11:35:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:35:54,648 INFO L225 Difference]: With dead ends: 130862 [2019-09-08 11:35:54,648 INFO L226 Difference]: Without dead ends: 52352 [2019-09-08 11:35:54,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:35:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52352 states. [2019-09-08 11:36:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52352 to 48640. [2019-09-08 11:36:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48640 states. [2019-09-08 11:36:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48640 states to 48640 states and 60000 transitions. [2019-09-08 11:36:15,785 INFO L78 Accepts]: Start accepts. Automaton has 48640 states and 60000 transitions. Word has length 109 [2019-09-08 11:36:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:36:15,785 INFO L475 AbstractCegarLoop]: Abstraction has 48640 states and 60000 transitions. [2019-09-08 11:36:15,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:36:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 48640 states and 60000 transitions. [2019-09-08 11:36:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 11:36:15,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:36:15,790 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:36:15,790 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:36:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:36:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash 467603715, now seen corresponding path program 1 times [2019-09-08 11:36:15,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:36:15,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:36:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:36:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:36:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:36:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:36:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:36:16,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:36:16,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:36:16,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:36:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:36:16,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 11:36:16,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:36:16,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:36:16,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:36:16,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:36:17,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:36:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:36:18,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:36:18,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-09-08 11:36:18,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 11:36:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 11:36:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:36:18,142 INFO L87 Difference]: Start difference. First operand 48640 states and 60000 transitions. Second operand 30 states. [2019-09-08 11:36:18,315 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-08 11:36:23,884 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:36:25,220 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:36:27,203 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:36:27,541 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-08 11:36:28,262 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:36:29,756 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:36:32,810 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:36:37,786 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:36:38,645 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:36:39,696 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:36:40,494 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:36:41,878 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:36:43,225 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:36:43,912 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:36:45,093 WARN L188 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-09-08 11:36:46,849 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:36:52,073 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:36:52,588 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:36:54,181 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:37:00,203 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:37:05,001 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-08 11:37:06,214 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-09-08 11:37:09,199 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-08 11:37:09,979 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:37:10,458 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:37:10,699 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:37:11,053 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:37:13,628 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-08 11:37:16,390 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:37:17,126 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 11:37:19,797 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-08 11:37:26,364 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 11:37:27,024 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:37:27,465 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:37:28,803 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 11:37:29,066 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:37:29,837 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:37:30,336 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:37:36,094 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:37:36,588 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:37:38,856 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 11:37:39,493 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:37:40,655 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:37:45,151 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 11:37:49,512 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:37:53,015 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:37:57,166 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:37:58,964 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:37:59,319 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-08 11:38:00,712 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:38:02,607 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:38:04,199 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:38:04,672 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:38:07,905 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 11:38:11,954 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 11:38:13,779 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:38:14,881 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:39:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:39:08,899 INFO L93 Difference]: Finished difference Result 187430 states and 229396 transitions. [2019-09-08 11:39:08,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-09-08 11:39:08,899 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 109 [2019-09-08 11:39:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:39:09,056 INFO L225 Difference]: With dead ends: 187430 [2019-09-08 11:39:09,056 INFO L226 Difference]: Without dead ends: 140578 [2019-09-08 11:39:09,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18316 ImplicationChecksByTransitivity, 55.5s TimeCoverageRelationStatistics Valid=5785, Invalid=42392, Unknown=3, NotChecked=0, Total=48180 [2019-09-08 11:39:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140578 states. [2019-09-08 11:39:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140578 to 76562. [2019-09-08 11:39:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76562 states. [2019-09-08 11:39:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76562 states to 76562 states and 94056 transitions. [2019-09-08 11:39:45,108 INFO L78 Accepts]: Start accepts. Automaton has 76562 states and 94056 transitions. Word has length 109 [2019-09-08 11:39:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:39:45,109 INFO L475 AbstractCegarLoop]: Abstraction has 76562 states and 94056 transitions. [2019-09-08 11:39:45,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 11:39:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 76562 states and 94056 transitions. [2019-09-08 11:39:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 11:39:45,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:39:45,113 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:39:45,113 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:39:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:39:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1780734919, now seen corresponding path program 1 times [2019-09-08 11:39:45,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:39:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:39:45,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:45,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:39:45,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:39:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:39:45,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:39:45,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:39:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:39:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:39:45,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 11:39:45,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:39:45,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:39:45,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:39:45,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:39:45,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:39:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:39:45,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:39:45,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 11:39:45,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:39:45,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:39:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:39:45,887 INFO L87 Difference]: Start difference. First operand 76562 states and 94056 transitions. Second operand 20 states.