java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:26:44,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:26:44,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:26:44,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:26:44,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:26:44,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:26:44,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:26:44,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:26:44,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:26:44,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:26:44,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:26:44,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:26:44,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:26:44,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:26:44,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:26:44,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:26:44,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:26:44,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:26:44,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:26:44,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:26:44,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:26:44,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:26:44,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:26:44,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:26:44,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:26:44,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:26:44,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:26:44,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:26:44,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:26:44,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:26:44,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:26:44,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:26:44,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:26:44,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:26:44,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:26:44,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:26:44,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:26:44,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:26:44,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:26:44,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:26:44,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:26:44,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:26:44,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:26:44,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:26:44,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:26:44,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:26:44,278 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:26:44,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:26:44,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:26:44,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:26:44,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:26:44,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:26:44,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:26:44,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:26:44,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:26:44,280 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:26:44,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:26:44,280 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:26:44,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:26:44,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:26:44,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:26:44,281 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:26:44,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:26:44,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:26:44,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:26:44,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:26:44,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:26:44,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:26:44,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:26:44,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:26:44,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:26:44,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:26:44,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:26:44,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:26:44,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:26:44,334 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:26:44,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:26:44,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f22d14f/e82a839b61bd45e8871cd6e500dd18c0/FLAG977db61f3 [2019-09-08 10:26:44,903 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:26:44,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:26:44,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f22d14f/e82a839b61bd45e8871cd6e500dd18c0/FLAG977db61f3 [2019-09-08 10:26:45,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f22d14f/e82a839b61bd45e8871cd6e500dd18c0 [2019-09-08 10:26:45,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:26:45,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:26:45,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:26:45,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:26:45,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:26:45,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3c99dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45, skipping insertion in model container [2019-09-08 10:26:45,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,284 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:26:45,357 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:26:45,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:26:45,812 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:26:45,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:26:45,938 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:26:45,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45 WrapperNode [2019-09-08 10:26:45,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:26:45,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:26:45,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:26:45,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:26:45,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:45,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... [2019-09-08 10:26:46,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:26:46,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:26:46,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:26:46,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:26:46,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:26:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:26:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:26:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:26:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:26:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:26:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:26:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:26:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:26:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:26:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:26:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:26:46,885 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:26:46,886 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:26:46,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:26:46 BoogieIcfgContainer [2019-09-08 10:26:46,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:26:46,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:26:46,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:26:46,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:26:46,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:26:45" (1/3) ... [2019-09-08 10:26:46,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5a6b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:26:46, skipping insertion in model container [2019-09-08 10:26:46,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:26:45" (2/3) ... [2019-09-08 10:26:46,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5a6b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:26:46, skipping insertion in model container [2019-09-08 10:26:46,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:26:46" (3/3) ... [2019-09-08 10:26:46,894 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:26:46,903 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:26:46,910 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:26:46,927 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:26:46,958 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:26:46,959 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:26:46,959 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:26:46,959 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:26:46,960 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:26:46,960 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:26:46,960 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:26:46,960 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:26:46,961 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:26:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-09-08 10:26:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 10:26:46,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:46,993 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 10:26:46,995 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:47,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash -276696918, now seen corresponding path program 1 times [2019-09-08 10:26:47,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:47,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:47,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:26:47,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:26:47,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:26:47,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:26:47,525 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 6 states. [2019-09-08 10:26:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:47,901 INFO L93 Difference]: Finished difference Result 721 states and 1142 transitions. [2019-09-08 10:26:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:26:47,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-09-08 10:26:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:47,925 INFO L225 Difference]: With dead ends: 721 [2019-09-08 10:26:47,925 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 10:26:47,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:26:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 10:26:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 423. [2019-09-08 10:26:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 10:26:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-09-08 10:26:48,033 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 52 [2019-09-08 10:26:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:48,034 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-09-08 10:26:48,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:26:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-09-08 10:26:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:26:48,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:48,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:48,038 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1087729035, now seen corresponding path program 1 times [2019-09-08 10:26:48,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:48,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:48,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:48,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:48,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:48,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:26:48,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:26:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:26:48,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:48,181 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 3 states. [2019-09-08 10:26:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:48,270 INFO L93 Difference]: Finished difference Result 1104 states and 1713 transitions. [2019-09-08 10:26:48,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:26:48,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:26:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:48,276 INFO L225 Difference]: With dead ends: 1104 [2019-09-08 10:26:48,277 INFO L226 Difference]: Without dead ends: 748 [2019-09-08 10:26:48,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-08 10:26:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-09-08 10:26:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-08 10:26:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1138 transitions. [2019-09-08 10:26:48,351 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1138 transitions. Word has length 55 [2019-09-08 10:26:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:48,352 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1138 transitions. [2019-09-08 10:26:48,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:26:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1138 transitions. [2019-09-08 10:26:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:26:48,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:48,363 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] [2019-09-08 10:26:48,363 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 917757431, now seen corresponding path program 1 times [2019-09-08 10:26:48,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:48,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:48,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:26:48,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:26:48,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:26:48,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:48,486 INFO L87 Difference]: Start difference. First operand 746 states and 1138 transitions. Second operand 3 states. [2019-09-08 10:26:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:48,592 INFO L93 Difference]: Finished difference Result 2006 states and 3079 transitions. [2019-09-08 10:26:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:26:48,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:26:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:48,604 INFO L225 Difference]: With dead ends: 2006 [2019-09-08 10:26:48,604 INFO L226 Difference]: Without dead ends: 1335 [2019-09-08 10:26:48,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:26:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-08 10:26:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-09-08 10:26:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-08 10:26:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2001 transitions. [2019-09-08 10:26:48,702 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2001 transitions. Word has length 55 [2019-09-08 10:26:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:48,705 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2001 transitions. [2019-09-08 10:26:48,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:26:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2001 transitions. [2019-09-08 10:26:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:26:48,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:48,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:48,707 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash -41555275, now seen corresponding path program 1 times [2019-09-08 10:26:48,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:48,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:48,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:48,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:48,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:26:48,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:26:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:26:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:26:48,830 INFO L87 Difference]: Start difference. First operand 1333 states and 2001 transitions. Second operand 6 states. [2019-09-08 10:26:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:49,266 INFO L93 Difference]: Finished difference Result 4201 states and 6339 transitions. [2019-09-08 10:26:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:26:49,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:26:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:49,281 INFO L225 Difference]: With dead ends: 4201 [2019-09-08 10:26:49,281 INFO L226 Difference]: Without dead ends: 2913 [2019-09-08 10:26:49,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:26:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-09-08 10:26:49,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2889. [2019-09-08 10:26:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2019-09-08 10:26:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4347 transitions. [2019-09-08 10:26:49,468 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4347 transitions. Word has length 56 [2019-09-08 10:26:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:49,469 INFO L475 AbstractCegarLoop]: Abstraction has 2889 states and 4347 transitions. [2019-09-08 10:26:49,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:26:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4347 transitions. [2019-09-08 10:26:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:26:49,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:49,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:49,471 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:49,471 INFO L82 PathProgramCache]: Analyzing trace with hash -742667424, now seen corresponding path program 1 times [2019-09-08 10:26:49,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:49,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:49,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:49,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:49,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:49,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:49,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:26:49,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:26:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:26:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:26:49,604 INFO L87 Difference]: Start difference. First operand 2889 states and 4347 transitions. Second operand 7 states. [2019-09-08 10:26:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:50,832 INFO L93 Difference]: Finished difference Result 13019 states and 19747 transitions. [2019-09-08 10:26:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:26:50,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:26:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:50,904 INFO L225 Difference]: With dead ends: 13019 [2019-09-08 10:26:50,904 INFO L226 Difference]: Without dead ends: 11884 [2019-09-08 10:26:50,914 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 10:26:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2019-09-08 10:26:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 2895. [2019-09-08 10:26:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-09-08 10:26:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4355 transitions. [2019-09-08 10:26:51,297 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4355 transitions. Word has length 57 [2019-09-08 10:26:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:51,298 INFO L475 AbstractCegarLoop]: Abstraction has 2895 states and 4355 transitions. [2019-09-08 10:26:51,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:26:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4355 transitions. [2019-09-08 10:26:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:26:51,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:51,301 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:51,301 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1896016447, now seen corresponding path program 1 times [2019-09-08 10:26:51,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:51,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:51,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:51,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:51,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:51,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:51,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:26:51,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:26:51,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:26:51,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:26:51,395 INFO L87 Difference]: Start difference. First operand 2895 states and 4355 transitions. Second operand 5 states. [2019-09-08 10:26:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:51,921 INFO L93 Difference]: Finished difference Result 6900 states and 10371 transitions. [2019-09-08 10:26:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:26:51,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-08 10:26:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:51,941 INFO L225 Difference]: With dead ends: 6900 [2019-09-08 10:26:51,942 INFO L226 Difference]: Without dead ends: 4085 [2019-09-08 10:26:51,947 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 10:26:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-09-08 10:26:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 2895. [2019-09-08 10:26:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-09-08 10:26:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4317 transitions. [2019-09-08 10:26:52,153 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4317 transitions. Word has length 57 [2019-09-08 10:26:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:52,154 INFO L475 AbstractCegarLoop]: Abstraction has 2895 states and 4317 transitions. [2019-09-08 10:26:52,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:26:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4317 transitions. [2019-09-08 10:26:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:26:52,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:52,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:52,156 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1439125625, now seen corresponding path program 1 times [2019-09-08 10:26:52,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:52,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:52,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:52,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:52,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:52,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:52,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:26:52,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:26:52,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:26:52,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:26:52,281 INFO L87 Difference]: Start difference. First operand 2895 states and 4317 transitions. Second operand 7 states. [2019-09-08 10:26:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:53,483 INFO L93 Difference]: Finished difference Result 12891 states and 19144 transitions. [2019-09-08 10:26:53,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:26:53,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:26:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:53,519 INFO L225 Difference]: With dead ends: 12891 [2019-09-08 10:26:53,519 INFO L226 Difference]: Without dead ends: 10257 [2019-09-08 10:26:53,525 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 10:26:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10257 states. [2019-09-08 10:26:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10257 to 2915. [2019-09-08 10:26:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2019-09-08 10:26:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4341 transitions. [2019-09-08 10:26:53,809 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4341 transitions. Word has length 58 [2019-09-08 10:26:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:53,810 INFO L475 AbstractCegarLoop]: Abstraction has 2915 states and 4341 transitions. [2019-09-08 10:26:53,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:26:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4341 transitions. [2019-09-08 10:26:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:26:53,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:53,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:53,812 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1177047496, now seen corresponding path program 1 times [2019-09-08 10:26:53,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:53,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:53,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:53,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:53,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:26:53,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:26:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:26:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:26:53,908 INFO L87 Difference]: Start difference. First operand 2915 states and 4341 transitions. Second operand 6 states. [2019-09-08 10:26:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:54,646 INFO L93 Difference]: Finished difference Result 10451 states and 15584 transitions. [2019-09-08 10:26:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:26:54,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-08 10:26:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:54,665 INFO L225 Difference]: With dead ends: 10451 [2019-09-08 10:26:54,665 INFO L226 Difference]: Without dead ends: 7637 [2019-09-08 10:26:54,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:26:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7637 states. [2019-09-08 10:26:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7637 to 7633. [2019-09-08 10:26:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-09-08 10:26:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11259 transitions. [2019-09-08 10:26:55,385 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11259 transitions. Word has length 59 [2019-09-08 10:26:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:55,385 INFO L475 AbstractCegarLoop]: Abstraction has 7633 states and 11259 transitions. [2019-09-08 10:26:55,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:26:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11259 transitions. [2019-09-08 10:26:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:26:55,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:55,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:55,391 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash 758768658, now seen corresponding path program 1 times [2019-09-08 10:26:55,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:55,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:55,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:55,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:55,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:26:55,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:26:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:26:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:26:55,455 INFO L87 Difference]: Start difference. First operand 7633 states and 11259 transitions. Second operand 5 states. [2019-09-08 10:26:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:56,419 INFO L93 Difference]: Finished difference Result 20122 states and 29836 transitions. [2019-09-08 10:26:56,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:26:56,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-08 10:26:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:56,462 INFO L225 Difference]: With dead ends: 20122 [2019-09-08 10:26:56,463 INFO L226 Difference]: Without dead ends: 16178 [2019-09-08 10:26:56,477 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 10:26:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16178 states. [2019-09-08 10:26:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16178 to 9877. [2019-09-08 10:26:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-09-08 10:26:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 14629 transitions. [2019-09-08 10:26:57,433 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 14629 transitions. Word has length 60 [2019-09-08 10:26:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:57,433 INFO L475 AbstractCegarLoop]: Abstraction has 9877 states and 14629 transitions. [2019-09-08 10:26:57,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:26:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 14629 transitions. [2019-09-08 10:26:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:26:57,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:57,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:57,437 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:57,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:57,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2035448048, now seen corresponding path program 1 times [2019-09-08 10:26:57,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:57,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:57,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:57,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:57,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:26:57,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:26:57,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:26:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:26:57,505 INFO L87 Difference]: Start difference. First operand 9877 states and 14629 transitions. Second operand 5 states. [2019-09-08 10:26:58,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:58,934 INFO L93 Difference]: Finished difference Result 21379 states and 31737 transitions. [2019-09-08 10:26:58,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:26:58,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-08 10:26:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:58,978 INFO L225 Difference]: With dead ends: 21379 [2019-09-08 10:26:58,979 INFO L226 Difference]: Without dead ends: 17435 [2019-09-08 10:26:58,993 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 10:26:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17435 states. [2019-09-08 10:26:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17435 to 11320. [2019-09-08 10:26:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11320 states. [2019-09-08 10:26:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 16793 transitions. [2019-09-08 10:26:59,748 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 16793 transitions. Word has length 60 [2019-09-08 10:26:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:59,749 INFO L475 AbstractCegarLoop]: Abstraction has 11320 states and 16793 transitions. [2019-09-08 10:26:59,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:26:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 16793 transitions. [2019-09-08 10:26:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:26:59,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:59,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:59,753 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2033763663, now seen corresponding path program 1 times [2019-09-08 10:26:59,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:59,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:59,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:59,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:59,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:59,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:26:59,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:26:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:26:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:26:59,835 INFO L87 Difference]: Start difference. First operand 11320 states and 16793 transitions. Second operand 7 states. [2019-09-08 10:27:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:03,792 INFO L93 Difference]: Finished difference Result 54051 states and 79490 transitions. [2019-09-08 10:27:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:27:03,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-08 10:27:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:03,894 INFO L225 Difference]: With dead ends: 54051 [2019-09-08 10:27:03,894 INFO L226 Difference]: Without dead ends: 48732 [2019-09-08 10:27:03,914 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 10:27:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48732 states. [2019-09-08 10:27:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48732 to 11416. [2019-09-08 10:27:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-09-08 10:27:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 16915 transitions. [2019-09-08 10:27:05,731 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 16915 transitions. Word has length 63 [2019-09-08 10:27:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:05,732 INFO L475 AbstractCegarLoop]: Abstraction has 11416 states and 16915 transitions. [2019-09-08 10:27:05,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:27:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 16915 transitions. [2019-09-08 10:27:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 10:27:05,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:05,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:05,736 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash -640902223, now seen corresponding path program 1 times [2019-09-08 10:27:05,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:05,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:05,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:05,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:27:05,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:27:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:27:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:05,782 INFO L87 Difference]: Start difference. First operand 11416 states and 16915 transitions. Second operand 3 states. [2019-09-08 10:27:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:07,220 INFO L93 Difference]: Finished difference Result 27762 states and 41149 transitions. [2019-09-08 10:27:07,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:07,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 10:27:07,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:07,244 INFO L225 Difference]: With dead ends: 27762 [2019-09-08 10:27:07,245 INFO L226 Difference]: Without dead ends: 16920 [2019-09-08 10:27:07,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16920 states. [2019-09-08 10:27:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16920 to 13802. [2019-09-08 10:27:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-09-08 10:27:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20148 transitions. [2019-09-08 10:27:08,609 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20148 transitions. Word has length 63 [2019-09-08 10:27:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:08,609 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20148 transitions. [2019-09-08 10:27:08,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:27:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20148 transitions. [2019-09-08 10:27:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:27:08,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:08,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:08,615 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash 3874310, now seen corresponding path program 1 times [2019-09-08 10:27:08,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:08,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:08,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:27:08,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:27:08,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:27:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:27:08,867 INFO L87 Difference]: Start difference. First operand 13802 states and 20148 transitions. Second operand 10 states. [2019-09-08 10:27:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:17,261 INFO L93 Difference]: Finished difference Result 72823 states and 105858 transitions. [2019-09-08 10:27:17,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:27:17,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:27:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:17,357 INFO L225 Difference]: With dead ends: 72823 [2019-09-08 10:27:17,357 INFO L226 Difference]: Without dead ends: 60047 [2019-09-08 10:27:17,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 10:27:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60047 states. [2019-09-08 10:27:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60047 to 13802. [2019-09-08 10:27:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-09-08 10:27:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20142 transitions. [2019-09-08 10:27:18,886 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20142 transitions. Word has length 65 [2019-09-08 10:27:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:18,886 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20142 transitions. [2019-09-08 10:27:18,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:27:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20142 transitions. [2019-09-08 10:27:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:27:18,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:18,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] [2019-09-08 10:27:18,892 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1838871740, now seen corresponding path program 1 times [2019-09-08 10:27:18,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:18,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:18,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:18,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:18,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:19,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:19,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:27:19,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:27:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:27:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:27:19,058 INFO L87 Difference]: Start difference. First operand 13802 states and 20142 transitions. Second operand 10 states. [2019-09-08 10:27:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:24,544 INFO L93 Difference]: Finished difference Result 50585 states and 73484 transitions. [2019-09-08 10:27:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:27:24,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:27:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:24,583 INFO L225 Difference]: With dead ends: 50585 [2019-09-08 10:27:24,583 INFO L226 Difference]: Without dead ends: 37871 [2019-09-08 10:27:24,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-09-08 10:27:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37871 states. [2019-09-08 10:27:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37871 to 13590. [2019-09-08 10:27:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13590 states. [2019-09-08 10:27:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13590 states to 13590 states and 19823 transitions. [2019-09-08 10:27:26,115 INFO L78 Accepts]: Start accepts. Automaton has 13590 states and 19823 transitions. Word has length 65 [2019-09-08 10:27:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:26,116 INFO L475 AbstractCegarLoop]: Abstraction has 13590 states and 19823 transitions. [2019-09-08 10:27:26,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:27:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13590 states and 19823 transitions. [2019-09-08 10:27:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 10:27:26,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:26,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:26,120 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash 434457602, now seen corresponding path program 1 times [2019-09-08 10:27:26,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:26,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:26,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:26,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:26,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:26,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:26,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:27:26,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:27:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:27:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:27:26,288 INFO L87 Difference]: Start difference. First operand 13590 states and 19823 transitions. Second operand 10 states. [2019-09-08 10:27:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:35,701 INFO L93 Difference]: Finished difference Result 71942 states and 104617 transitions. [2019-09-08 10:27:35,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 10:27:35,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-08 10:27:35,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:35,764 INFO L225 Difference]: With dead ends: 71942 [2019-09-08 10:27:35,764 INFO L226 Difference]: Without dead ends: 59406 [2019-09-08 10:27:35,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:27:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59406 states. [2019-09-08 10:27:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59406 to 13459. [2019-09-08 10:27:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-09-08 10:27:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 19616 transitions. [2019-09-08 10:27:37,579 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 19616 transitions. Word has length 65 [2019-09-08 10:27:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:37,580 INFO L475 AbstractCegarLoop]: Abstraction has 13459 states and 19616 transitions. [2019-09-08 10:27:37,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:27:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 19616 transitions. [2019-09-08 10:27:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:27:37,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:37,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:37,584 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash 451101849, now seen corresponding path program 1 times [2019-09-08 10:27:37,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:37,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:37,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:37,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:37,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:37,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:37,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:27:37,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:27:37,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:27:37,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:37,635 INFO L87 Difference]: Start difference. First operand 13459 states and 19616 transitions. Second operand 3 states. [2019-09-08 10:27:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:39,389 INFO L93 Difference]: Finished difference Result 19543 states and 28416 transitions. [2019-09-08 10:27:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:39,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:27:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:39,403 INFO L225 Difference]: With dead ends: 19543 [2019-09-08 10:27:39,403 INFO L226 Difference]: Without dead ends: 13443 [2019-09-08 10:27:39,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13443 states. [2019-09-08 10:27:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13443 to 13441. [2019-09-08 10:27:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13441 states. [2019-09-08 10:27:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13441 states to 13441 states and 19290 transitions. [2019-09-08 10:27:41,000 INFO L78 Accepts]: Start accepts. Automaton has 13441 states and 19290 transitions. Word has length 66 [2019-09-08 10:27:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:41,001 INFO L475 AbstractCegarLoop]: Abstraction has 13441 states and 19290 transitions. [2019-09-08 10:27:41,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:27:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13441 states and 19290 transitions. [2019-09-08 10:27:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:27:41,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:41,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:41,004 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1791143987, now seen corresponding path program 1 times [2019-09-08 10:27:41,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:41,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:41,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:41,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:41,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:27:41,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:27:41,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:27:41,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:41,056 INFO L87 Difference]: Start difference. First operand 13441 states and 19290 transitions. Second operand 3 states. [2019-09-08 10:27:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:42,812 INFO L93 Difference]: Finished difference Result 18163 states and 25978 transitions. [2019-09-08 10:27:42,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:42,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:27:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:42,824 INFO L225 Difference]: With dead ends: 18163 [2019-09-08 10:27:42,824 INFO L226 Difference]: Without dead ends: 12081 [2019-09-08 10:27:42,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12081 states. [2019-09-08 10:27:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12081 to 12079. [2019-09-08 10:27:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12079 states. [2019-09-08 10:27:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12079 states to 12079 states and 17023 transitions. [2019-09-08 10:27:44,218 INFO L78 Accepts]: Start accepts. Automaton has 12079 states and 17023 transitions. Word has length 66 [2019-09-08 10:27:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:44,218 INFO L475 AbstractCegarLoop]: Abstraction has 12079 states and 17023 transitions. [2019-09-08 10:27:44,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:27:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12079 states and 17023 transitions. [2019-09-08 10:27:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:27:44,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:44,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:44,224 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:44,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1997471743, now seen corresponding path program 1 times [2019-09-08 10:27:44,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:44,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:44,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:44,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:44,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:44,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:44,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:27:44,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:27:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:27:44,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:44,265 INFO L87 Difference]: Start difference. First operand 12079 states and 17023 transitions. Second operand 3 states. [2019-09-08 10:27:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:45,637 INFO L93 Difference]: Finished difference Result 14693 states and 20612 transitions. [2019-09-08 10:27:45,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:45,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 10:27:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:45,646 INFO L225 Difference]: With dead ends: 14693 [2019-09-08 10:27:45,646 INFO L226 Difference]: Without dead ends: 10303 [2019-09-08 10:27:45,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2019-09-08 10:27:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 10301. [2019-09-08 10:27:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-09-08 10:27:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 14211 transitions. [2019-09-08 10:27:46,824 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 14211 transitions. Word has length 66 [2019-09-08 10:27:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:46,824 INFO L475 AbstractCegarLoop]: Abstraction has 10301 states and 14211 transitions. [2019-09-08 10:27:46,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:27:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 14211 transitions. [2019-09-08 10:27:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:27:46,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:46,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:46,827 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1675019531, now seen corresponding path program 1 times [2019-09-08 10:27:46,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:46,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:46,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:27:46,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:27:46,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:27:46,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:46,868 INFO L87 Difference]: Start difference. First operand 10301 states and 14211 transitions. Second operand 3 states. [2019-09-08 10:27:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:49,128 INFO L93 Difference]: Finished difference Result 19134 states and 26484 transitions. [2019-09-08 10:27:49,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:49,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:27:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:49,141 INFO L225 Difference]: With dead ends: 19134 [2019-09-08 10:27:49,141 INFO L226 Difference]: Without dead ends: 15154 [2019-09-08 10:27:49,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15154 states. [2019-09-08 10:27:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15154 to 10108. [2019-09-08 10:27:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2019-09-08 10:27:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 13933 transitions. [2019-09-08 10:27:50,464 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 13933 transitions. Word has length 67 [2019-09-08 10:27:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:50,464 INFO L475 AbstractCegarLoop]: Abstraction has 10108 states and 13933 transitions. [2019-09-08 10:27:50,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:27:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 13933 transitions. [2019-09-08 10:27:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:27:50,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:50,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:50,467 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:50,467 INFO L82 PathProgramCache]: Analyzing trace with hash 641499340, now seen corresponding path program 1 times [2019-09-08 10:27:50,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:50,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:50,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:50,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:27:50,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:27:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:27:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:50,500 INFO L87 Difference]: Start difference. First operand 10108 states and 13933 transitions. Second operand 3 states. [2019-09-08 10:27:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:52,631 INFO L93 Difference]: Finished difference Result 18916 states and 26144 transitions. [2019-09-08 10:27:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:27:52,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:27:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:52,645 INFO L225 Difference]: With dead ends: 18916 [2019-09-08 10:27:52,645 INFO L226 Difference]: Without dead ends: 15010 [2019-09-08 10:27:52,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:27:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15010 states. [2019-09-08 10:27:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15010 to 9964. [2019-09-08 10:27:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9964 states. [2019-09-08 10:27:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9964 states to 9964 states and 13716 transitions. [2019-09-08 10:27:54,100 INFO L78 Accepts]: Start accepts. Automaton has 9964 states and 13716 transitions. Word has length 67 [2019-09-08 10:27:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:54,100 INFO L475 AbstractCegarLoop]: Abstraction has 9964 states and 13716 transitions. [2019-09-08 10:27:54,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:27:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9964 states and 13716 transitions. [2019-09-08 10:27:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:27:54,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:54,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:27:54,102 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:54,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1770759349, now seen corresponding path program 1 times [2019-09-08 10:27:54,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:54,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:54,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:54,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:54,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:55,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:55,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 10:27:55,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 10:27:55,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 10:27:55,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:27:55,135 INFO L87 Difference]: Start difference. First operand 9964 states and 13716 transitions. Second operand 19 states. [2019-09-08 10:27:56,101 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 10:27:56,360 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-08 10:27:56,749 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-08 10:27:57,087 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-09-08 10:27:57,315 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 10:27:57,580 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 10:27:57,946 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 10:27:58,117 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 10:27:58,298 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 10:27:58,582 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-08 10:27:58,745 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 10:27:58,952 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 10:27:59,120 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 10:27:59,407 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 10:27:59,686 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:28:03,686 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 10:28:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:08,724 INFO L93 Difference]: Finished difference Result 41230 states and 57173 transitions. [2019-09-08 10:28:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 10:28:08,725 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-08 10:28:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:08,767 INFO L225 Difference]: With dead ends: 41230 [2019-09-08 10:28:08,768 INFO L226 Difference]: Without dead ends: 40242 [2019-09-08 10:28:08,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 10:28:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40242 states. [2019-09-08 10:28:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40242 to 9970. [2019-09-08 10:28:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9970 states. [2019-09-08 10:28:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9970 states to 9970 states and 13717 transitions. [2019-09-08 10:28:10,703 INFO L78 Accepts]: Start accepts. Automaton has 9970 states and 13717 transitions. Word has length 67 [2019-09-08 10:28:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:10,703 INFO L475 AbstractCegarLoop]: Abstraction has 9970 states and 13717 transitions. [2019-09-08 10:28:10,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 10:28:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9970 states and 13717 transitions. [2019-09-08 10:28:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:28:10,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:10,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:10,705 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:10,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1042489363, now seen corresponding path program 1 times [2019-09-08 10:28:10,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:10,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:10,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:11,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:11,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 10:28:11,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 10:28:11,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 10:28:11,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:28:11,738 INFO L87 Difference]: Start difference. First operand 9970 states and 13717 transitions. Second operand 19 states. [2019-09-08 10:28:12,322 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 10:28:12,521 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 10:28:12,882 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-08 10:28:13,195 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-09-08 10:28:13,387 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 10:28:13,656 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-08 10:28:14,083 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-08 10:28:14,266 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 10:28:14,513 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 10:28:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:19,083 INFO L93 Difference]: Finished difference Result 19716 states and 27253 transitions. [2019-09-08 10:28:19,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:28:19,084 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-08 10:28:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:19,103 INFO L225 Difference]: With dead ends: 19716 [2019-09-08 10:28:19,104 INFO L226 Difference]: Without dead ends: 18746 [2019-09-08 10:28:19,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:28:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18746 states. [2019-09-08 10:28:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18746 to 9927. [2019-09-08 10:28:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-09-08 10:28:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 13657 transitions. [2019-09-08 10:28:21,547 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 13657 transitions. Word has length 67 [2019-09-08 10:28:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:21,548 INFO L475 AbstractCegarLoop]: Abstraction has 9927 states and 13657 transitions. [2019-09-08 10:28:21,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 10:28:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 13657 transitions. [2019-09-08 10:28:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:28:21,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:21,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:21,551 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash -78198627, now seen corresponding path program 1 times [2019-09-08 10:28:21,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:21,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:21,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:21,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:21,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:21,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:21,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:28:21,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:28:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:28:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:28:21,987 INFO L87 Difference]: Start difference. First operand 9927 states and 13657 transitions. Second operand 11 states. [2019-09-08 10:28:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:26,915 INFO L93 Difference]: Finished difference Result 23537 states and 32534 transitions. [2019-09-08 10:28:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:28:26,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-08 10:28:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:26,937 INFO L225 Difference]: With dead ends: 23537 [2019-09-08 10:28:26,937 INFO L226 Difference]: Without dead ends: 21197 [2019-09-08 10:28:26,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:28:26,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21197 states. [2019-09-08 10:28:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21197 to 9790. [2019-09-08 10:28:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9790 states. [2019-09-08 10:28:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9790 states to 9790 states and 13476 transitions. [2019-09-08 10:28:28,935 INFO L78 Accepts]: Start accepts. Automaton has 9790 states and 13476 transitions. Word has length 68 [2019-09-08 10:28:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:28,935 INFO L475 AbstractCegarLoop]: Abstraction has 9790 states and 13476 transitions. [2019-09-08 10:28:28,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:28:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 9790 states and 13476 transitions. [2019-09-08 10:28:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:28:28,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:28,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:28,937 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash 780074214, now seen corresponding path program 1 times [2019-09-08 10:28:28,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:28,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:28,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:28,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:28,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:29,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:29,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:28:29,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:28:29,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:28:29,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:28:29,003 INFO L87 Difference]: Start difference. First operand 9790 states and 13476 transitions. Second operand 5 states. [2019-09-08 10:28:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:31,042 INFO L93 Difference]: Finished difference Result 9796 states and 13479 transitions. [2019-09-08 10:28:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:28:31,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-08 10:28:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:31,049 INFO L225 Difference]: With dead ends: 9796 [2019-09-08 10:28:31,050 INFO L226 Difference]: Without dead ends: 9416 [2019-09-08 10:28:31,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:28:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-09-08 10:28:32,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 9412. [2019-09-08 10:28:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9412 states. [2019-09-08 10:28:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9412 states to 9412 states and 12976 transitions. [2019-09-08 10:28:32,828 INFO L78 Accepts]: Start accepts. Automaton has 9412 states and 12976 transitions. Word has length 69 [2019-09-08 10:28:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:32,829 INFO L475 AbstractCegarLoop]: Abstraction has 9412 states and 12976 transitions. [2019-09-08 10:28:32,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:28:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 9412 states and 12976 transitions. [2019-09-08 10:28:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:28:32,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:32,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:32,832 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash 210202670, now seen corresponding path program 1 times [2019-09-08 10:28:32,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:32,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:32,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:32,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:32,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:32,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:32,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:28:32,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:28:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:28:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:28:32,894 INFO L87 Difference]: Start difference. First operand 9412 states and 12976 transitions. Second operand 6 states. [2019-09-08 10:28:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:36,855 INFO L93 Difference]: Finished difference Result 17954 states and 24446 transitions. [2019-09-08 10:28:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:28:36,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:28:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:36,881 INFO L225 Difference]: With dead ends: 17954 [2019-09-08 10:28:36,881 INFO L226 Difference]: Without dead ends: 17952 [2019-09-08 10:28:36,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:28:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2019-09-08 10:28:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 9727. [2019-09-08 10:28:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-09-08 10:28:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 13206 transitions. [2019-09-08 10:28:39,661 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 13206 transitions. Word has length 72 [2019-09-08 10:28:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:39,661 INFO L475 AbstractCegarLoop]: Abstraction has 9727 states and 13206 transitions. [2019-09-08 10:28:39,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:28:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 13206 transitions. [2019-09-08 10:28:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:28:39,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:39,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:39,664 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:39,664 INFO L82 PathProgramCache]: Analyzing trace with hash -61361821, now seen corresponding path program 1 times [2019-09-08 10:28:39,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:39,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:39,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:39,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:39,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:39,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:28:39,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:28:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:28:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:28:39,712 INFO L87 Difference]: Start difference. First operand 9727 states and 13206 transitions. Second operand 3 states. [2019-09-08 10:28:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:43,431 INFO L93 Difference]: Finished difference Result 26401 states and 35919 transitions. [2019-09-08 10:28:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:28:43,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:28:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:43,448 INFO L225 Difference]: With dead ends: 26401 [2019-09-08 10:28:43,449 INFO L226 Difference]: Without dead ends: 17128 [2019-09-08 10:28:43,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:28:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2019-09-08 10:28:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 16916. [2019-09-08 10:28:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2019-09-08 10:28:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 22620 transitions. [2019-09-08 10:28:47,029 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 22620 transitions. Word has length 73 [2019-09-08 10:28:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:47,029 INFO L475 AbstractCegarLoop]: Abstraction has 16916 states and 22620 transitions. [2019-09-08 10:28:47,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:28:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 22620 transitions. [2019-09-08 10:28:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:28:47,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:47,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:47,033 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1062164750, now seen corresponding path program 1 times [2019-09-08 10:28:47,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:47,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:47,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:47,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:47,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:47,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:28:47,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:28:47,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:28:47,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:28:47,071 INFO L87 Difference]: Start difference. First operand 16916 states and 22620 transitions. Second operand 3 states. [2019-09-08 10:28:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:54,301 INFO L93 Difference]: Finished difference Result 47928 states and 63874 transitions. [2019-09-08 10:28:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:28:54,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:28:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:54,334 INFO L225 Difference]: With dead ends: 47928 [2019-09-08 10:28:54,334 INFO L226 Difference]: Without dead ends: 31580 [2019-09-08 10:28:54,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:28:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31580 states. [2019-09-08 10:29:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31580 to 29294. [2019-09-08 10:29:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29294 states. [2019-09-08 10:29:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29294 states to 29294 states and 38754 transitions. [2019-09-08 10:29:00,770 INFO L78 Accepts]: Start accepts. Automaton has 29294 states and 38754 transitions. Word has length 75 [2019-09-08 10:29:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:00,770 INFO L475 AbstractCegarLoop]: Abstraction has 29294 states and 38754 transitions. [2019-09-08 10:29:00,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 29294 states and 38754 transitions. [2019-09-08 10:29:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:29:00,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:00,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:29:00,773 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1917451455, now seen corresponding path program 1 times [2019-09-08 10:29:00,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:00,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:00,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:00,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:00,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:00,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:00,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:00,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:00,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:00,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:00,816 INFO L87 Difference]: Start difference. First operand 29294 states and 38754 transitions. Second operand 3 states. [2019-09-08 10:29:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:11,274 INFO L93 Difference]: Finished difference Result 74390 states and 98184 transitions. [2019-09-08 10:29:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:11,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:29:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:11,319 INFO L225 Difference]: With dead ends: 74390 [2019-09-08 10:29:11,319 INFO L226 Difference]: Without dead ends: 45531 [2019-09-08 10:29:11,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45531 states. [2019-09-08 10:29:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45531 to 41593. [2019-09-08 10:29:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41593 states. [2019-09-08 10:29:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41593 states to 41593 states and 54589 transitions. [2019-09-08 10:29:21,778 INFO L78 Accepts]: Start accepts. Automaton has 41593 states and 54589 transitions. Word has length 76 [2019-09-08 10:29:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:21,778 INFO L475 AbstractCegarLoop]: Abstraction has 41593 states and 54589 transitions. [2019-09-08 10:29:21,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 41593 states and 54589 transitions. [2019-09-08 10:29:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:29:21,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:21,781 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 10:29:21,781 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2051052788, now seen corresponding path program 1 times [2019-09-08 10:29:21,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:21,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:21,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:21,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:21,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:29:21,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:21,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:21,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:21,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:21,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:21,829 INFO L87 Difference]: Start difference. First operand 41593 states and 54589 transitions. Second operand 5 states. [2019-09-08 10:29:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:38,006 INFO L93 Difference]: Finished difference Result 108155 states and 140769 transitions. [2019-09-08 10:29:38,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:29:38,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 10:29:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:38,080 INFO L225 Difference]: With dead ends: 108155 [2019-09-08 10:29:38,080 INFO L226 Difference]: Without dead ends: 66958 [2019-09-08 10:29:38,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:29:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66958 states. [2019-09-08 10:29:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66958 to 38533. [2019-09-08 10:29:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38533 states. [2019-09-08 10:29:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38533 states to 38533 states and 49058 transitions. [2019-09-08 10:29:48,351 INFO L78 Accepts]: Start accepts. Automaton has 38533 states and 49058 transitions. Word has length 82 [2019-09-08 10:29:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:48,352 INFO L475 AbstractCegarLoop]: Abstraction has 38533 states and 49058 transitions. [2019-09-08 10:29:48,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:29:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 38533 states and 49058 transitions. [2019-09-08 10:29:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 10:29:48,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:48,356 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:29:48,356 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:48,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:48,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1781698448, now seen corresponding path program 1 times [2019-09-08 10:29:48,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:48,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:48,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:48,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:48,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 10:29:48,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:48,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:48,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:48,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:48,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:48,418 INFO L87 Difference]: Start difference. First operand 38533 states and 49058 transitions. Second operand 3 states. [2019-09-08 10:30:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:05,408 INFO L93 Difference]: Finished difference Result 110379 states and 139910 transitions. [2019-09-08 10:30:05,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:05,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 10:30:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:05,485 INFO L225 Difference]: With dead ends: 110379 [2019-09-08 10:30:05,485 INFO L226 Difference]: Without dead ends: 72268 [2019-09-08 10:30:05,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72268 states. [2019-09-08 10:30:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72268 to 62526. [2019-09-08 10:30:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62526 states. [2019-09-08 10:30:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62526 states to 62526 states and 78749 transitions. [2019-09-08 10:30:21,310 INFO L78 Accepts]: Start accepts. Automaton has 62526 states and 78749 transitions. Word has length 93 [2019-09-08 10:30:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:21,310 INFO L475 AbstractCegarLoop]: Abstraction has 62526 states and 78749 transitions. [2019-09-08 10:30:21,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 62526 states and 78749 transitions. [2019-09-08 10:30:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 10:30:21,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:21,315 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:30:21,315 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1356554498, now seen corresponding path program 1 times [2019-09-08 10:30:21,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:21,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:21,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:21,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:30:21,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:30:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:30:21,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:30:21,501 INFO L87 Difference]: Start difference. First operand 62526 states and 78749 transitions. Second operand 10 states. [2019-09-08 10:31:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:17,996 INFO L93 Difference]: Finished difference Result 254610 states and 318799 transitions. [2019-09-08 10:31:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:31:17,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-09-08 10:31:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:18,260 INFO L225 Difference]: With dead ends: 254610 [2019-09-08 10:31:18,260 INFO L226 Difference]: Without dead ends: 217112 [2019-09-08 10:31:18,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 10:31:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217112 states. [2019-09-08 10:31:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217112 to 83792. [2019-09-08 10:31:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83792 states. [2019-09-08 10:31:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83792 states to 83792 states and 105525 transitions. [2019-09-08 10:31:39,323 INFO L78 Accepts]: Start accepts. Automaton has 83792 states and 105525 transitions. Word has length 96 [2019-09-08 10:31:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:39,324 INFO L475 AbstractCegarLoop]: Abstraction has 83792 states and 105525 transitions. [2019-09-08 10:31:39,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:31:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 83792 states and 105525 transitions. [2019-09-08 10:31:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 10:31:39,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:39,329 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:39,329 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1244823914, now seen corresponding path program 1 times [2019-09-08 10:31:39,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:39,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:39,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:39,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:39,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:31:39,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:31:39,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:39,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:31:39,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:31:39,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:31:39,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:31:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:31:40,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:31:40,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-08 10:31:40,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 10:31:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 10:31:40,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:31:40,651 INFO L87 Difference]: Start difference. First operand 83792 states and 105525 transitions. Second operand 20 states. [2019-09-08 10:31:40,923 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 10:31:41,190 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 10:31:42,804 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-08 10:31:43,306 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-08 10:31:46,022 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 10:31:46,710 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 10:31:47,238 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-08 10:31:47,833 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 10:31:48,902 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-08 10:31:51,905 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 10:31:52,994 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-08 10:31:53,714 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-08 10:31:54,056 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-08 10:31:54,705 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 10:32:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:50,301 INFO L93 Difference]: Finished difference Result 260959 states and 325631 transitions. [2019-09-08 10:32:50,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 10:32:50,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-09-08 10:32:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:50,841 INFO L225 Difference]: With dead ends: 260959 [2019-09-08 10:32:50,842 INFO L226 Difference]: Without dead ends: 216931 [2019-09-08 10:32:50,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1011, Invalid=3279, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 10:32:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216931 states. [2019-09-08 10:33:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216931 to 115674. [2019-09-08 10:33:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115674 states. [2019-09-08 10:33:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115674 states to 115674 states and 145709 transitions. [2019-09-08 10:33:27,189 INFO L78 Accepts]: Start accepts. Automaton has 115674 states and 145709 transitions. Word has length 96 [2019-09-08 10:33:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:27,189 INFO L475 AbstractCegarLoop]: Abstraction has 115674 states and 145709 transitions. [2019-09-08 10:33:27,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 10:33:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 115674 states and 145709 transitions. [2019-09-08 10:33:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:33:27,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:27,201 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:33:27,201 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash 942692355, now seen corresponding path program 1 times [2019-09-08 10:33:27,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:27,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:27,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:33:27,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:33:27,331 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) [2019-09-08 10:33:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:33:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:27,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 10:33:27,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:33:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:33:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:33:27,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 11 [2019-09-08 10:33:27,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:33:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:33:27,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:33:27,769 INFO L87 Difference]: Start difference. First operand 115674 states and 145709 transitions. Second operand 11 states. [2019-09-08 10:34:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:19,791 INFO L93 Difference]: Finished difference Result 295076 states and 369922 transitions. [2019-09-08 10:34:19,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 10:34:19,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-09-08 10:34:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:20,012 INFO L225 Difference]: With dead ends: 295076 [2019-09-08 10:34:20,012 INFO L226 Difference]: Without dead ends: 179824 [2019-09-08 10:34:20,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:34:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179824 states. [2019-09-08 10:35:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179824 to 146756. [2019-09-08 10:35:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146756 states. [2019-09-08 10:35:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146756 states to 146756 states and 184589 transitions. [2019-09-08 10:35:04,317 INFO L78 Accepts]: Start accepts. Automaton has 146756 states and 184589 transitions. Word has length 97 [2019-09-08 10:35:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:04,317 INFO L475 AbstractCegarLoop]: Abstraction has 146756 states and 184589 transitions. [2019-09-08 10:35:04,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:35:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 146756 states and 184589 transitions. [2019-09-08 10:35:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 10:35:04,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:04,335 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:35:04,335 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1947843037, now seen corresponding path program 1 times [2019-09-08 10:35:04,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:04,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:04,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:04,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:04,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 10:35:04,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:04,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:04,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:04,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:04,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:04,383 INFO L87 Difference]: Start difference. First operand 146756 states and 184589 transitions. Second operand 3 states. [2019-09-08 10:35:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:44,044 INFO L93 Difference]: Finished difference Result 275862 states and 347403 transitions. [2019-09-08 10:35:44,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:35:44,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 10:35:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:44,204 INFO L225 Difference]: With dead ends: 275862 [2019-09-08 10:35:44,204 INFO L226 Difference]: Without dead ends: 132564 [2019-09-08 10:35:44,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132564 states. [2019-09-08 10:36:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132564 to 132564. [2019-09-08 10:36:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132564 states. [2019-09-08 10:36:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132564 states to 132564 states and 165554 transitions. [2019-09-08 10:36:19,938 INFO L78 Accepts]: Start accepts. Automaton has 132564 states and 165554 transitions. Word has length 107 [2019-09-08 10:36:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:19,939 INFO L475 AbstractCegarLoop]: Abstraction has 132564 states and 165554 transitions. [2019-09-08 10:36:19,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 132564 states and 165554 transitions. [2019-09-08 10:36:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 10:36:19,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:19,953 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:36:19,953 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1403781913, now seen corresponding path program 1 times [2019-09-08 10:36:19,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:19,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:19,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:20,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:20,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:36:20,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:36:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:36:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:36:20,016 INFO L87 Difference]: Start difference. First operand 132564 states and 165554 transitions. Second operand 5 states. [2019-09-08 10:37:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:06,882 INFO L93 Difference]: Finished difference Result 286895 states and 357283 transitions. [2019-09-08 10:37:06,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:37:06,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-08 10:37:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:07,068 INFO L225 Difference]: With dead ends: 286895 [2019-09-08 10:37:07,068 INFO L226 Difference]: Without dead ends: 154753 [2019-09-08 10:37:07,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:37:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154753 states. [2019-09-08 10:37:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154753 to 124120. [2019-09-08 10:37:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124120 states. [2019-09-08 10:37:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124120 states to 124120 states and 152340 transitions. [2019-09-08 10:37:40,902 INFO L78 Accepts]: Start accepts. Automaton has 124120 states and 152340 transitions. Word has length 107 [2019-09-08 10:37:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:40,902 INFO L475 AbstractCegarLoop]: Abstraction has 124120 states and 152340 transitions. [2019-09-08 10:37:40,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:37:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 124120 states and 152340 transitions. [2019-09-08 10:37:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 10:37:40,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:40,912 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:40,912 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:40,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1309307435, now seen corresponding path program 1 times [2019-09-08 10:37:40,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:40,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:40,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:40,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:37:40,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:37:40,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:41,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:37:41,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:37:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:41,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:37:41,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-08 10:37:41,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:37:41,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:37:41,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:37:41,507 INFO L87 Difference]: Start difference. First operand 124120 states and 152340 transitions. Second operand 10 states. [2019-09-08 10:38:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:38,396 INFO L93 Difference]: Finished difference Result 307202 states and 373955 transitions. [2019-09-08 10:38:38,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:38:38,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2019-09-08 10:38:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:38,623 INFO L225 Difference]: With dead ends: 307202 [2019-09-08 10:38:38,623 INFO L226 Difference]: Without dead ends: 183504 [2019-09-08 10:38:38,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:38:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183504 states. [2019-09-08 10:39:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183504 to 130919. [2019-09-08 10:39:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130919 states. [2019-09-08 10:39:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130919 states to 130919 states and 160122 transitions. [2019-09-08 10:39:15,776 INFO L78 Accepts]: Start accepts. Automaton has 130919 states and 160122 transitions. Word has length 108 [2019-09-08 10:39:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:15,777 INFO L475 AbstractCegarLoop]: Abstraction has 130919 states and 160122 transitions. [2019-09-08 10:39:15,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:39:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 130919 states and 160122 transitions. [2019-09-08 10:39:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 10:39:15,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:15,789 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:39:15,789 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash 382852877, now seen corresponding path program 1 times [2019-09-08 10:39:15,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 10:39:15,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:15,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:39:15,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:39:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:39:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:39:15,863 INFO L87 Difference]: Start difference. First operand 130919 states and 160122 transitions. Second operand 4 states.