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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:42:48,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:42:48,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:42:48,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:42:48,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:42:48,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:42:48,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:42:48,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:42:48,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:42:48,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:42:48,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:42:48,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:42:48,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:42:48,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:42:48,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:42:48,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:42:48,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:42:48,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:42:48,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:42:48,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:42:48,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:42:48,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:42:48,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:42:48,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:42:48,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:42:48,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:42:48,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:42:48,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:42:48,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:42:48,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:42:48,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:42:48,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:42:48,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:42:48,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:42:48,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:42:48,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:42:48,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:42:48,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:42:48,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:42:48,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:42:48,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:42:48,358 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:42:48,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:42:48,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:42:48,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:42:48,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:42:48,383 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:42:48,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:42:48,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:42:48,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:42:48,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:42:48,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:42:48,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:42:48,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:42:48,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:42:48,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:42:48,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:42:48,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:42:48,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:42:48,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:42:48,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:42:48,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:42:48,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:42:48,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:42:48,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:42:48,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:42:48,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:42:48,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:42:48,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:42:48,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:42:48,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:42:48,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:42:48,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:42:48,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:42:48,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:42:48,472 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:42:48,473 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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:42:48,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd5fa43d/33e56881e202469bb781d24695abdbcc/FLAG3299fa31c [2019-09-08 10:42:49,066 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:42:49,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:42:49,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd5fa43d/33e56881e202469bb781d24695abdbcc/FLAG3299fa31c [2019-09-08 10:42:49,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bd5fa43d/33e56881e202469bb781d24695abdbcc [2019-09-08 10:42:49,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:42:49,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:42:49,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:42:49,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:42:49,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:42:49,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:42:49" (1/1) ... [2019-09-08 10:42:49,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:49, skipping insertion in model container [2019-09-08 10:42:49,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:42:49" (1/1) ... [2019-09-08 10:42:49,402 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:42:49,462 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:42:49,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:42:49,889 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:42:49,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:42:50,009 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:42:50,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50 WrapperNode [2019-09-08 10:42:50,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:42:50,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:42:50,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:42:50,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:42:50,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (1/1) ... [2019-09-08 10:42:50,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (1/1) ... [2019-09-08 10:42:50,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (1/1) ... [2019-09-08 10:42:50,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (1/1) ... [2019-09-08 10:42:50,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (1/1) ... [2019-09-08 10:42:50,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (1/1) ... [2019-09-08 10:42:50,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (1/1) ... [2019-09-08 10:42:50,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:42:50,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:42:50,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:42:50,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:42:50,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (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:42:50,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:42:50,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:42:50,136 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:42:50,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:42:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:42:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:42:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:42:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:42:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:42:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:42:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:42:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:42:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:42:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:42:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:42:50,138 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:42:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:42:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:42:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:42:50,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:42:51,063 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:42:51,064 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:42:51,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:42:51 BoogieIcfgContainer [2019-09-08 10:42:51,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:42:51,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:42:51,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:42:51,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:42:51,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:42:49" (1/3) ... [2019-09-08 10:42:51,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637a98f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:42:51, skipping insertion in model container [2019-09-08 10:42:51,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:42:50" (2/3) ... [2019-09-08 10:42:51,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637a98f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:42:51, skipping insertion in model container [2019-09-08 10:42:51,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:42:51" (3/3) ... [2019-09-08 10:42:51,074 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 10:42:51,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:42:51,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:42:51,110 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:42:51,145 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:42:51,146 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:42:51,146 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:42:51,147 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:42:51,147 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:42:51,147 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:42:51,147 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:42:51,148 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:42:51,148 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:42:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2019-09-08 10:42:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:42:51,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:51,186 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:42:51,188 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:51,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1726351890, now seen corresponding path program 1 times [2019-09-08 10:42:51,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:51,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:51,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:51,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:51,719 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:42:51,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:51,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:42:51,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:42:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:42:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:42:51,745 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 7 states. [2019-09-08 10:42:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:52,350 INFO L93 Difference]: Finished difference Result 1129 states and 1812 transitions. [2019-09-08 10:42:52,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:42:52,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 10:42:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:52,387 INFO L225 Difference]: With dead ends: 1129 [2019-09-08 10:42:52,387 INFO L226 Difference]: Without dead ends: 1024 [2019-09-08 10:42:52,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:42:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-09-08 10:42:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 514. [2019-09-08 10:42:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-09-08 10:42:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 794 transitions. [2019-09-08 10:42:52,552 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 794 transitions. Word has length 68 [2019-09-08 10:42:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:52,553 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 794 transitions. [2019-09-08 10:42:52,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:42:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 794 transitions. [2019-09-08 10:42:52,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:42:52,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:52,566 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:42:52,567 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2038700647, now seen corresponding path program 1 times [2019-09-08 10:42:52,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:52,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:52,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:52,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:52,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:52,892 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:42:52,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:42:52,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:42:52,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:42:52,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:42:52,896 INFO L87 Difference]: Start difference. First operand 514 states and 794 transitions. Second operand 6 states. [2019-09-08 10:42:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:53,197 INFO L93 Difference]: Finished difference Result 1839 states and 2878 transitions. [2019-09-08 10:42:53,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:42:53,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:42:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:53,210 INFO L225 Difference]: With dead ends: 1839 [2019-09-08 10:42:53,210 INFO L226 Difference]: Without dead ends: 1391 [2019-09-08 10:42:53,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:42:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-09-08 10:42:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1385. [2019-09-08 10:42:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2019-09-08 10:42:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2148 transitions. [2019-09-08 10:42:53,304 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2148 transitions. Word has length 69 [2019-09-08 10:42:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:53,304 INFO L475 AbstractCegarLoop]: Abstraction has 1385 states and 2148 transitions. [2019-09-08 10:42:53,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:42:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2148 transitions. [2019-09-08 10:42:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:42:53,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:53,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:53,312 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash 618782839, now seen corresponding path program 1 times [2019-09-08 10:42:53,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:53,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:53,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:53,440 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:42:53,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:53,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:42:53,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:42:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:42:53,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:42:53,442 INFO L87 Difference]: Start difference. First operand 1385 states and 2148 transitions. Second operand 5 states. [2019-09-08 10:42:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:53,901 INFO L93 Difference]: Finished difference Result 3938 states and 6158 transitions. [2019-09-08 10:42:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:42:53,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 10:42:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:53,914 INFO L225 Difference]: With dead ends: 3938 [2019-09-08 10:42:53,915 INFO L226 Difference]: Without dead ends: 2591 [2019-09-08 10:42:53,918 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:42:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2019-09-08 10:42:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2589. [2019-09-08 10:42:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2589 states. [2019-09-08 10:42:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4019 transitions. [2019-09-08 10:42:54,065 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4019 transitions. Word has length 70 [2019-09-08 10:42:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:54,066 INFO L475 AbstractCegarLoop]: Abstraction has 2589 states and 4019 transitions. [2019-09-08 10:42:54,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:42:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4019 transitions. [2019-09-08 10:42:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:42:54,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:54,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:54,069 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:54,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1384706248, now seen corresponding path program 1 times [2019-09-08 10:42:54,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:54,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:54,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:54,175 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:42:54,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:54,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:42:54,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:42:54,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:42:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:42:54,177 INFO L87 Difference]: Start difference. First operand 2589 states and 4019 transitions. Second operand 6 states. [2019-09-08 10:42:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:54,879 INFO L93 Difference]: Finished difference Result 9596 states and 14955 transitions. [2019-09-08 10:42:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:42:54,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:42:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:54,918 INFO L225 Difference]: With dead ends: 9596 [2019-09-08 10:42:54,919 INFO L226 Difference]: Without dead ends: 7061 [2019-09-08 10:42:54,933 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:42:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7061 states. [2019-09-08 10:42:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7061 to 7057. [2019-09-08 10:42:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2019-09-08 10:42:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 10942 transitions. [2019-09-08 10:42:55,626 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 10942 transitions. Word has length 70 [2019-09-08 10:42:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:55,626 INFO L475 AbstractCegarLoop]: Abstraction has 7057 states and 10942 transitions. [2019-09-08 10:42:55,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:42:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 10942 transitions. [2019-09-08 10:42:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:42:55,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:55,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:55,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -554775271, now seen corresponding path program 1 times [2019-09-08 10:42:55,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:55,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:55,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:55,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:42:55,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:42:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:42:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:42:55,782 INFO L87 Difference]: Start difference. First operand 7057 states and 10942 transitions. Second operand 6 states. [2019-09-08 10:42:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:57,054 INFO L93 Difference]: Finished difference Result 26718 states and 41454 transitions. [2019-09-08 10:42:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:42:57,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:42:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:57,141 INFO L225 Difference]: With dead ends: 26718 [2019-09-08 10:42:57,141 INFO L226 Difference]: Without dead ends: 19738 [2019-09-08 10:42:57,159 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:42:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19738 states. [2019-09-08 10:42:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19738 to 19734. [2019-09-08 10:42:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19734 states. [2019-09-08 10:42:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19734 states to 19734 states and 30467 transitions. [2019-09-08 10:42:58,300 INFO L78 Accepts]: Start accepts. Automaton has 19734 states and 30467 transitions. Word has length 70 [2019-09-08 10:42:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:58,301 INFO L475 AbstractCegarLoop]: Abstraction has 19734 states and 30467 transitions. [2019-09-08 10:42:58,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:42:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19734 states and 30467 transitions. [2019-09-08 10:42:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:42:58,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:58,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:58,305 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash -744278678, now seen corresponding path program 1 times [2019-09-08 10:42:58,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:58,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:58,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:58,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:58,397 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:42:58,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:58,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:42:58,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:42:58,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:42:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:42:58,399 INFO L87 Difference]: Start difference. First operand 19734 states and 30467 transitions. Second operand 6 states. [2019-09-08 10:43:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:01,002 INFO L93 Difference]: Finished difference Result 75916 states and 117242 transitions. [2019-09-08 10:43:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:43:01,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:43:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:01,170 INFO L225 Difference]: With dead ends: 75916 [2019-09-08 10:43:01,170 INFO L226 Difference]: Without dead ends: 56286 [2019-09-08 10:43:01,223 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:43:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56286 states. [2019-09-08 10:43:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56286 to 49952. [2019-09-08 10:43:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49952 states. [2019-09-08 10:43:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49952 states to 49952 states and 76827 transitions. [2019-09-08 10:43:04,478 INFO L78 Accepts]: Start accepts. Automaton has 49952 states and 76827 transitions. Word has length 70 [2019-09-08 10:43:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:04,478 INFO L475 AbstractCegarLoop]: Abstraction has 49952 states and 76827 transitions. [2019-09-08 10:43:04,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:43:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 49952 states and 76827 transitions. [2019-09-08 10:43:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:43:04,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:04,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:04,483 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash 106374034, now seen corresponding path program 1 times [2019-09-08 10:43:04,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:04,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:04,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:04,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:04,577 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:43:04,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:04,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:43:04,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:43:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:43:04,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:43:04,579 INFO L87 Difference]: Start difference. First operand 49952 states and 76827 transitions. Second operand 5 states. [2019-09-08 10:43:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:08,419 INFO L93 Difference]: Finished difference Result 82858 states and 126706 transitions. [2019-09-08 10:43:08,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:43:08,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:43:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:08,618 INFO L225 Difference]: With dead ends: 82858 [2019-09-08 10:43:08,618 INFO L226 Difference]: Without dead ends: 82856 [2019-09-08 10:43:08,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:43:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82856 states. [2019-09-08 10:43:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82856 to 50744. [2019-09-08 10:43:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50744 states. [2019-09-08 10:43:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50744 states to 50744 states and 77385 transitions. [2019-09-08 10:43:11,254 INFO L78 Accepts]: Start accepts. Automaton has 50744 states and 77385 transitions. Word has length 71 [2019-09-08 10:43:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:11,254 INFO L475 AbstractCegarLoop]: Abstraction has 50744 states and 77385 transitions. [2019-09-08 10:43:11,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:43:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 50744 states and 77385 transitions. [2019-09-08 10:43:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:43:11,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:11,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:11,261 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash -718918452, now seen corresponding path program 1 times [2019-09-08 10:43:11,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:11,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:11,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:43:11,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:11,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:43:11,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:43:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:43:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:43:11,537 INFO L87 Difference]: Start difference. First operand 50744 states and 77385 transitions. Second operand 10 states. [2019-09-08 10:43:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:28,044 INFO L93 Difference]: Finished difference Result 355170 states and 535308 transitions. [2019-09-08 10:43:28,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:43:28,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:43:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:28,776 INFO L225 Difference]: With dead ends: 355170 [2019-09-08 10:43:28,777 INFO L226 Difference]: Without dead ends: 305114 [2019-09-08 10:43:28,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:43:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305114 states. [2019-09-08 10:43:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305114 to 50783. [2019-09-08 10:43:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50783 states. [2019-09-08 10:43:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50783 states to 50783 states and 77421 transitions. [2019-09-08 10:43:33,513 INFO L78 Accepts]: Start accepts. Automaton has 50783 states and 77421 transitions. Word has length 72 [2019-09-08 10:43:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:33,513 INFO L475 AbstractCegarLoop]: Abstraction has 50783 states and 77421 transitions. [2019-09-08 10:43:33,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:43:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50783 states and 77421 transitions. [2019-09-08 10:43:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:43:33,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:33,517 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:43:33,517 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:33,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1903245012, now seen corresponding path program 1 times [2019-09-08 10:43:33,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:33,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:33,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:33,720 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:43:33,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:33,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:43:33,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:43:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:43:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:43:33,722 INFO L87 Difference]: Start difference. First operand 50783 states and 77421 transitions. Second operand 10 states. [2019-09-08 10:44:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:03,722 INFO L93 Difference]: Finished difference Result 420777 states and 641424 transitions. [2019-09-08 10:44:03,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 10:44:03,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:44:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:04,429 INFO L225 Difference]: With dead ends: 420777 [2019-09-08 10:44:04,429 INFO L226 Difference]: Without dead ends: 386009 [2019-09-08 10:44:04,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:44:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386009 states. [2019-09-08 10:44:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386009 to 50994. [2019-09-08 10:44:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50994 states. [2019-09-08 10:44:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50994 states to 50994 states and 77683 transitions. [2019-09-08 10:44:10,688 INFO L78 Accepts]: Start accepts. Automaton has 50994 states and 77683 transitions. Word has length 72 [2019-09-08 10:44:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:10,689 INFO L475 AbstractCegarLoop]: Abstraction has 50994 states and 77683 transitions. [2019-09-08 10:44:10,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:44:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 50994 states and 77683 transitions. [2019-09-08 10:44:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:44:10,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:10,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:10,694 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash 946021772, now seen corresponding path program 1 times [2019-09-08 10:44:10,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:10,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:10,962 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:44:10,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:10,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:44:10,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:44:10,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:44:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:44:10,964 INFO L87 Difference]: Start difference. First operand 50994 states and 77683 transitions. Second operand 10 states. [2019-09-08 10:44:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:42,502 INFO L93 Difference]: Finished difference Result 352373 states and 536374 transitions. [2019-09-08 10:44:42,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 10:44:42,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:44:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:43,048 INFO L225 Difference]: With dead ends: 352373 [2019-09-08 10:44:43,049 INFO L226 Difference]: Without dead ends: 330687 [2019-09-08 10:44:43,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 10:44:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330687 states. [2019-09-08 10:44:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330687 to 51387. [2019-09-08 10:44:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51387 states. [2019-09-08 10:44:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51387 states to 51387 states and 78180 transitions. [2019-09-08 10:44:49,552 INFO L78 Accepts]: Start accepts. Automaton has 51387 states and 78180 transitions. Word has length 72 [2019-09-08 10:44:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:49,552 INFO L475 AbstractCegarLoop]: Abstraction has 51387 states and 78180 transitions. [2019-09-08 10:44:49,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:44:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 51387 states and 78180 transitions. [2019-09-08 10:44:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:44:49,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:49,559 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:44:49,559 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1011565036, now seen corresponding path program 1 times [2019-09-08 10:44:49,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:49,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:49,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:49,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:49,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:44:49,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:44:49,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:44:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:44:49,790 INFO L87 Difference]: Start difference. First operand 51387 states and 78180 transitions. Second operand 10 states. [2019-09-08 10:45:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:23,740 INFO L93 Difference]: Finished difference Result 310815 states and 472435 transitions. [2019-09-08 10:45:23,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:45:23,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:45:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:24,406 INFO L225 Difference]: With dead ends: 310815 [2019-09-08 10:45:24,407 INFO L226 Difference]: Without dead ends: 298080 [2019-09-08 10:45:24,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:45:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298080 states. [2019-09-08 10:45:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298080 to 51387. [2019-09-08 10:45:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51387 states. [2019-09-08 10:45:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51387 states to 51387 states and 78172 transitions. [2019-09-08 10:45:31,829 INFO L78 Accepts]: Start accepts. Automaton has 51387 states and 78172 transitions. Word has length 72 [2019-09-08 10:45:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:31,829 INFO L475 AbstractCegarLoop]: Abstraction has 51387 states and 78172 transitions. [2019-09-08 10:45:31,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:45:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 51387 states and 78172 transitions. [2019-09-08 10:45:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:45:31,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:31,835 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:45:31,835 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:31,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:31,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1901872630, now seen corresponding path program 1 times [2019-09-08 10:45:31,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:31,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:31,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:31,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:31,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:31,881 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:45:31,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:31,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:45:31,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:45:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:45:31,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:45:31,883 INFO L87 Difference]: Start difference. First operand 51387 states and 78172 transitions. Second operand 3 states. [2019-09-08 10:45:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:41,895 INFO L93 Difference]: Finished difference Result 112389 states and 171163 transitions. [2019-09-08 10:45:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:45:41,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:45:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:41,988 INFO L225 Difference]: With dead ends: 112389 [2019-09-08 10:45:41,988 INFO L226 Difference]: Without dead ends: 72980 [2019-09-08 10:45:42,019 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:45:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72980 states. [2019-09-08 10:45:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72980 to 72138. [2019-09-08 10:45:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72138 states. [2019-09-08 10:45:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72138 states to 72138 states and 108585 transitions. [2019-09-08 10:45:49,763 INFO L78 Accepts]: Start accepts. Automaton has 72138 states and 108585 transitions. Word has length 73 [2019-09-08 10:45:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:49,764 INFO L475 AbstractCegarLoop]: Abstraction has 72138 states and 108585 transitions. [2019-09-08 10:45:49,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 72138 states and 108585 transitions. [2019-09-08 10:45:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:45:49,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:49,769 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:45:49,769 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash -244859483, now seen corresponding path program 1 times [2019-09-08 10:45:49,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:49,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:49,870 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:45:49,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:49,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:45:49,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:45:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:45:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:45:49,871 INFO L87 Difference]: Start difference. First operand 72138 states and 108585 transitions. Second operand 4 states. [2019-09-08 10:46:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:03,429 INFO L93 Difference]: Finished difference Result 185410 states and 278444 transitions. [2019-09-08 10:46:03,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:46:03,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 10:46:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:03,944 INFO L225 Difference]: With dead ends: 185410 [2019-09-08 10:46:03,944 INFO L226 Difference]: Without dead ends: 114918 [2019-09-08 10:46:04,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:46:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114918 states. [2019-09-08 10:46:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114918 to 114082. [2019-09-08 10:46:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114082 states. [2019-09-08 10:46:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114082 states to 114082 states and 169754 transitions. [2019-09-08 10:46:19,117 INFO L78 Accepts]: Start accepts. Automaton has 114082 states and 169754 transitions. Word has length 73 [2019-09-08 10:46:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:19,117 INFO L475 AbstractCegarLoop]: Abstraction has 114082 states and 169754 transitions. [2019-09-08 10:46:19,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:46:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 114082 states and 169754 transitions. [2019-09-08 10:46:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:46:19,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:19,121 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:46:19,122 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:19,122 INFO L82 PathProgramCache]: Analyzing trace with hash 909512172, now seen corresponding path program 1 times [2019-09-08 10:46:19,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:19,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:19,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:19,176 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:46:19,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:19,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:19,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:19,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:19,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:19,177 INFO L87 Difference]: Start difference. First operand 114082 states and 169754 transitions. Second operand 3 states. [2019-09-08 10:46:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:38,701 INFO L93 Difference]: Finished difference Result 206557 states and 306409 transitions. [2019-09-08 10:46:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:46:38,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:46:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:38,897 INFO L225 Difference]: With dead ends: 206557 [2019-09-08 10:46:38,898 INFO L226 Difference]: Without dead ends: 138383 [2019-09-08 10:46:38,966 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:46:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138383 states. [2019-09-08 10:46:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138383 to 136653. [2019-09-08 10:46:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136653 states. [2019-09-08 10:46:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136653 states to 136653 states and 199728 transitions. [2019-09-08 10:46:55,555 INFO L78 Accepts]: Start accepts. Automaton has 136653 states and 199728 transitions. Word has length 73 [2019-09-08 10:46:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:55,555 INFO L475 AbstractCegarLoop]: Abstraction has 136653 states and 199728 transitions. [2019-09-08 10:46:55,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:46:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 136653 states and 199728 transitions. [2019-09-08 10:46:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:46:55,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:55,559 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:46:55,559 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 907139436, now seen corresponding path program 1 times [2019-09-08 10:46:55,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:55,600 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:46:55,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:55,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:55,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:55,602 INFO L87 Difference]: Start difference. First operand 136653 states and 199728 transitions. Second operand 3 states. [2019-09-08 10:47:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:26,587 INFO L93 Difference]: Finished difference Result 341255 states and 498624 transitions. [2019-09-08 10:47:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:26,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:47:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:26,965 INFO L225 Difference]: With dead ends: 341255 [2019-09-08 10:47:26,965 INFO L226 Difference]: Without dead ends: 220359 [2019-09-08 10:47:27,071 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:47:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220359 states. [2019-09-08 10:47:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220359 to 219699. [2019-09-08 10:47:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219699 states. [2019-09-08 10:47:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219699 states to 219699 states and 317258 transitions. [2019-09-08 10:47:59,332 INFO L78 Accepts]: Start accepts. Automaton has 219699 states and 317258 transitions. Word has length 73 [2019-09-08 10:47:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:59,332 INFO L475 AbstractCegarLoop]: Abstraction has 219699 states and 317258 transitions. [2019-09-08 10:47:59,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 219699 states and 317258 transitions. [2019-09-08 10:47:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:47:59,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:59,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:59,338 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash -865418125, now seen corresponding path program 1 times [2019-09-08 10:47:59,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:59,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:59,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:59,435 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:47:59,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:59,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:47:59,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:47:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:47:59,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:47:59,437 INFO L87 Difference]: Start difference. First operand 219699 states and 317258 transitions. Second operand 7 states. [2019-09-08 10:50:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:01,655 INFO L93 Difference]: Finished difference Result 971886 states and 1391166 transitions. [2019-09-08 10:50:01,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:50:01,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:50:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:03,198 INFO L225 Difference]: With dead ends: 971886 [2019-09-08 10:50:03,198 INFO L226 Difference]: Without dead ends: 794047 [2019-09-08 10:50:03,438 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:50:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794047 states. [2019-09-08 10:50:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794047 to 219739. [2019-09-08 10:50:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219739 states. [2019-09-08 10:50:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219739 states to 219739 states and 317306 transitions. [2019-09-08 10:50:46,724 INFO L78 Accepts]: Start accepts. Automaton has 219739 states and 317306 transitions. Word has length 74 [2019-09-08 10:50:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:46,724 INFO L475 AbstractCegarLoop]: Abstraction has 219739 states and 317306 transitions. [2019-09-08 10:50:46,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:50:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 219739 states and 317306 transitions. [2019-09-08 10:50:46,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:50:46,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:46,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:50:46,728 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:46,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1280232077, now seen corresponding path program 1 times [2019-09-08 10:50:46,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:46,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:46,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:46,810 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:50:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:46,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:50:46,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:50:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:50:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:50:46,811 INFO L87 Difference]: Start difference. First operand 219739 states and 317306 transitions. Second operand 7 states. [2019-09-08 10:53:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:11,413 INFO L93 Difference]: Finished difference Result 946330 states and 1359429 transitions. [2019-09-08 10:53:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:53:11,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:53:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:13,049 INFO L225 Difference]: With dead ends: 946330 [2019-09-08 10:53:13,049 INFO L226 Difference]: Without dead ends: 851862 [2019-09-08 10:53:13,253 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:53:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851862 states. [2019-09-08 10:53:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851862 to 219843. [2019-09-08 10:53:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219843 states. [2019-09-08 10:53:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219843 states to 219843 states and 317431 transitions. [2019-09-08 10:53:59,438 INFO L78 Accepts]: Start accepts. Automaton has 219843 states and 317431 transitions. Word has length 74 [2019-09-08 10:53:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:59,439 INFO L475 AbstractCegarLoop]: Abstraction has 219843 states and 317431 transitions. [2019-09-08 10:53:59,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:53:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 219843 states and 317431 transitions. [2019-09-08 10:53:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:53:59,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:59,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:53:59,443 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash 109033983, now seen corresponding path program 1 times [2019-09-08 10:53:59,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:59,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:59,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:59,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:59,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:59,519 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:53:59,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:59,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:53:59,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:53:59,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:53:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:59,521 INFO L87 Difference]: Start difference. First operand 219843 states and 317431 transitions. Second operand 7 states.