/usr/bin/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_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:14:38,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:14:38,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:14:38,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:14:38,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:14:38,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:14:38,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:14:38,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:14:38,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:14:38,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:14:38,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:14:38,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:14:38,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:14:38,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:14:38,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:14:38,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:14:38,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:14:38,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:14:38,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:14:38,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:14:38,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:14:38,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:14:38,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:14:38,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:14:38,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:14:38,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:14:38,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:14:38,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:14:38,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:14:38,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:14:38,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:14:38,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:14:38,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:14:38,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:14:38,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:14:38,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:14:38,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:14:38,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:14:38,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:14:38,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:14:38,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:14:38,299 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-11-06 22:14:38,327 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:14:38,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:14:38,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:14:38,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:14:38,330 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:14:38,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:14:38,330 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:14:38,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:14:38,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:14:38,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:14:38,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:14:38,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:14:38,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:14:38,333 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:14:38,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:14:38,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:14:38,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:14:38,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:14:38,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:14:38,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:14:38,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:14:38,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:14:38,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:14:38,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:14:38,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:14:38,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:14:38,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:14:38,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:14:38,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:14:38,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:14:38,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:14:38,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:14:38,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:14:38,625 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:14:38,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:14:38,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9288e52/0fa09ccd177e4ea6b8df80bb8470b133/FLAGc8dad807f [2019-11-06 22:14:39,205 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:14:39,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:14:39,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9288e52/0fa09ccd177e4ea6b8df80bb8470b133/FLAGc8dad807f [2019-11-06 22:14:39,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9288e52/0fa09ccd177e4ea6b8df80bb8470b133 [2019-11-06 22:14:39,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:14:39,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:14:39,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:14:39,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:14:39,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:14:39,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:39" (1/1) ... [2019-11-06 22:14:39,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee4954f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:39, skipping insertion in model container [2019-11-06 22:14:39,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:39" (1/1) ... [2019-11-06 22:14:39,569 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:14:39,635 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:14:40,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:14:40,159 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:14:40,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:14:40,319 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:14:40,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40 WrapperNode [2019-11-06 22:14:40,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:14:40,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:14:40,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:14:40,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:14:40,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (1/1) ... [2019-11-06 22:14:40,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (1/1) ... [2019-11-06 22:14:40,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (1/1) ... [2019-11-06 22:14:40,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (1/1) ... [2019-11-06 22:14:40,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (1/1) ... [2019-11-06 22:14:40,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (1/1) ... [2019-11-06 22:14:40,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (1/1) ... [2019-11-06 22:14:40,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:14:40,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:14:40,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:14:40,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:14:40,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (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-11-06 22:14:40,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:14:40,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:14:40,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:14:40,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:14:40,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:14:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:14:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:14:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:14:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:14:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:14:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:14:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:14:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:14:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:14:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:14:40,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:14:40,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:14:40,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:14:41,666 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:14:41,667 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:14:41,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:41 BoogieIcfgContainer [2019-11-06 22:14:41,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:14:41,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:14:41,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:14:41,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:14:41,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:39" (1/3) ... [2019-11-06 22:14:41,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3e2bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:41, skipping insertion in model container [2019-11-06 22:14:41,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:40" (2/3) ... [2019-11-06 22:14:41,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3e2bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:41, skipping insertion in model container [2019-11-06 22:14:41,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:41" (3/3) ... [2019-11-06 22:14:41,677 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:14:41,688 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:14:41,697 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:14:41,709 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:14:41,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:14:41,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:14:41,740 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:14:41,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:14:41,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:14:41,741 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:14:41,741 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:14:41,741 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:14:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-11-06 22:14:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-06 22:14:41,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:41,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:41,782 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-11-06 22:14:41,796 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:41,797 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856712203] [2019-11-06 22:14:41,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:42,590 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:42,658 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856712203] [2019-11-06 22:14:42,659 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:42,659 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:14:42,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118158120] [2019-11-06 22:14:42,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:14:42,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:14:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:42,684 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2019-11-06 22:14:43,008 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-11-06 22:14:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:44,309 INFO L93 Difference]: Finished difference Result 489 states and 838 transitions. [2019-11-06 22:14:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:14:44,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-06 22:14:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:44,328 INFO L225 Difference]: With dead ends: 489 [2019-11-06 22:14:44,329 INFO L226 Difference]: Without dead ends: 362 [2019-11-06 22:14:44,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:14:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-06 22:14:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-11-06 22:14:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-06 22:14:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-11-06 22:14:44,428 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-11-06 22:14:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:44,429 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-11-06 22:14:44,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:14:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-11-06 22:14:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-06 22:14:44,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:44,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:44,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-11-06 22:14:44,434 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:44,434 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71853086] [2019-11-06 22:14:44,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:45,036 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:45,071 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71853086] [2019-11-06 22:14:45,071 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:45,071 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:14:45,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995128146] [2019-11-06 22:14:45,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:14:45,073 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:14:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:14:45,074 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 5 states. [2019-11-06 22:14:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:46,840 INFO L93 Difference]: Finished difference Result 1038 states and 1576 transitions. [2019-11-06 22:14:46,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:14:46,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-11-06 22:14:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:46,846 INFO L225 Difference]: With dead ends: 1038 [2019-11-06 22:14:46,846 INFO L226 Difference]: Without dead ends: 691 [2019-11-06 22:14:46,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:14:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-06 22:14:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-11-06 22:14:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-06 22:14:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-11-06 22:14:46,903 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-11-06 22:14:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:46,904 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-11-06 22:14:46,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:14:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-11-06 22:14:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:14:46,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:46,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:46,908 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-11-06 22:14:46,909 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:46,909 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423613042] [2019-11-06 22:14:46,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:47,211 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:47,235 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423613042] [2019-11-06 22:14:47,235 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:47,236 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:14:47,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118186295] [2019-11-06 22:14:47,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:14:47,237 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:14:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:47,237 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 4 states. [2019-11-06 22:14:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:49,162 INFO L93 Difference]: Finished difference Result 2021 states and 3044 transitions. [2019-11-06 22:14:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:14:49,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-06 22:14:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:49,170 INFO L225 Difference]: With dead ends: 2021 [2019-11-06 22:14:49,170 INFO L226 Difference]: Without dead ends: 1364 [2019-11-06 22:14:49,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-11-06 22:14:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-11-06 22:14:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-06 22:14:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-11-06 22:14:49,237 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-11-06 22:14:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:49,241 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-11-06 22:14:49,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:14:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-11-06 22:14:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:14:49,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:49,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:49,254 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:49,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-11-06 22:14:49,256 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:49,256 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571842550] [2019-11-06 22:14:49,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:49,702 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:49,743 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571842550] [2019-11-06 22:14:49,743 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:49,743 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:14:49,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881127083] [2019-11-06 22:14:49,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:14:49,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:49,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:14:49,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:49,746 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 4 states. [2019-11-06 22:14:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:51,637 INFO L93 Difference]: Finished difference Result 1822 states and 2765 transitions. [2019-11-06 22:14:51,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:14:51,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-06 22:14:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:51,648 INFO L225 Difference]: With dead ends: 1822 [2019-11-06 22:14:51,649 INFO L226 Difference]: Without dead ends: 1330 [2019-11-06 22:14:51,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-11-06 22:14:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-11-06 22:14:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-11-06 22:14:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-11-06 22:14:51,722 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-11-06 22:14:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:51,724 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-11-06 22:14:51,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:14:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-11-06 22:14:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:14:51,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:51,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:51,727 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-11-06 22:14:51,728 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:51,728 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863599057] [2019-11-06 22:14:51,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:52,141 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:52,186 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863599057] [2019-11-06 22:14:52,186 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:52,186 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:14:52,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329086637] [2019-11-06 22:14:52,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:14:52,187 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:52,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:14:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:14:52,188 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 5 states. [2019-11-06 22:14:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:53,424 INFO L93 Difference]: Finished difference Result 2157 states and 3243 transitions. [2019-11-06 22:14:53,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:14:53,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-06 22:14:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:53,431 INFO L225 Difference]: With dead ends: 2157 [2019-11-06 22:14:53,431 INFO L226 Difference]: Without dead ends: 1016 [2019-11-06 22:14:53,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:14:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-11-06 22:14:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-11-06 22:14:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-11-06 22:14:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-11-06 22:14:53,484 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-11-06 22:14:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:53,484 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-11-06 22:14:53,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:14:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-11-06 22:14:53,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:14:53,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:53,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:53,487 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-11-06 22:14:53,488 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:53,488 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438503037] [2019-11-06 22:14:53,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:53,776 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:53,818 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438503037] [2019-11-06 22:14:53,819 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:53,819 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:14:53,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524913481] [2019-11-06 22:14:53,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:14:53,820 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:53,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:14:53,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:53,821 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 4 states. [2019-11-06 22:14:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:55,142 INFO L93 Difference]: Finished difference Result 2291 states and 3531 transitions. [2019-11-06 22:14:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:14:55,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-06 22:14:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:55,151 INFO L225 Difference]: With dead ends: 2291 [2019-11-06 22:14:55,151 INFO L226 Difference]: Without dead ends: 1464 [2019-11-06 22:14:55,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-11-06 22:14:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-11-06 22:14:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-11-06 22:14:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-11-06 22:14:55,233 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-11-06 22:14:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:55,235 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-11-06 22:14:55,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:14:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-11-06 22:14:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-06 22:14:55,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:55,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:55,238 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-11-06 22:14:55,238 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:55,238 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544883224] [2019-11-06 22:14:55,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:55,605 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:55,649 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544883224] [2019-11-06 22:14:55,650 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:55,650 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:14:55,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741318839] [2019-11-06 22:14:55,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:14:55,651 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:14:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:55,655 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 4 states. [2019-11-06 22:14:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:56,997 INFO L93 Difference]: Finished difference Result 3397 states and 5357 transitions. [2019-11-06 22:14:56,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:14:56,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-06 22:14:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:57,008 INFO L225 Difference]: With dead ends: 3397 [2019-11-06 22:14:57,009 INFO L226 Difference]: Without dead ends: 2238 [2019-11-06 22:14:57,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:14:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-11-06 22:14:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-11-06 22:14:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-11-06 22:14:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-11-06 22:14:57,114 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-11-06 22:14:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:57,114 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-11-06 22:14:57,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:14:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-11-06 22:14:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:14:57,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:57,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:57,117 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-11-06 22:14:57,118 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:57,118 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972968486] [2019-11-06 22:14:57,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:57,543 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:57,579 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972968486] [2019-11-06 22:14:57,579 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:57,579 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:14:57,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441978963] [2019-11-06 22:14:57,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:14:57,580 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:57,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:14:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:14:57,581 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 6 states. [2019-11-06 22:14:57,841 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:14:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:14:58,886 INFO L93 Difference]: Finished difference Result 4171 states and 6562 transitions. [2019-11-06 22:14:58,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:14:58,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-06 22:14:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:14:58,896 INFO L225 Difference]: With dead ends: 4171 [2019-11-06 22:14:58,896 INFO L226 Difference]: Without dead ends: 2178 [2019-11-06 22:14:58,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:14:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-11-06 22:14:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-11-06 22:14:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-11-06 22:14:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-11-06 22:14:59,003 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-11-06 22:14:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:14:59,004 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-11-06 22:14:59,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:14:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-11-06 22:14:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:14:59,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:14:59,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:14:59,007 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:14:59,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:14:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-11-06 22:14:59,008 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:14:59,008 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428492288] [2019-11-06 22:14:59,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:14:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:59,407 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:14:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:14:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:14:59,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428492288] [2019-11-06 22:14:59,439 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:14:59,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:14:59,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97861529] [2019-11-06 22:14:59,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:14:59,440 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:14:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:14:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:14:59,441 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 5 states. [2019-11-06 22:15:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:00,961 INFO L93 Difference]: Finished difference Result 5611 states and 8738 transitions. [2019-11-06 22:15:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:00,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-06 22:15:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:00,976 INFO L225 Difference]: With dead ends: 5611 [2019-11-06 22:15:00,977 INFO L226 Difference]: Without dead ends: 3458 [2019-11-06 22:15:00,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:15:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-11-06 22:15:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-11-06 22:15:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-11-06 22:15:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-11-06 22:15:01,145 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-11-06 22:15:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:01,145 INFO L462 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-11-06 22:15:01,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-11-06 22:15:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-06 22:15:01,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:01,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:01,152 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:01,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-11-06 22:15:01,156 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:01,156 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843527712] [2019-11-06 22:15:01,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:01,442 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:15:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:01,472 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843527712] [2019-11-06 22:15:01,472 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:01,473 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:01,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928852079] [2019-11-06 22:15:01,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:01,474 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:01,474 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 4 states. [2019-11-06 22:15:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:03,322 INFO L93 Difference]: Finished difference Result 9594 states and 14954 transitions. [2019-11-06 22:15:03,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:03,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-06 22:15:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:03,343 INFO L225 Difference]: With dead ends: 9594 [2019-11-06 22:15:03,343 INFO L226 Difference]: Without dead ends: 6514 [2019-11-06 22:15:03,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-11-06 22:15:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-11-06 22:15:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-11-06 22:15:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-11-06 22:15:03,702 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-11-06 22:15:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:03,703 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-11-06 22:15:03,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-11-06 22:15:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-06 22:15:03,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:03,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:03,707 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:03,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:03,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-11-06 22:15:03,707 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:03,708 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959967054] [2019-11-06 22:15:03,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:04,015 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:15:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:04,042 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959967054] [2019-11-06 22:15:04,042 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:04,042 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:04,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117681660] [2019-11-06 22:15:04,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:04,043 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:04,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:04,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:04,044 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 5 states. [2019-11-06 22:15:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:05,172 INFO L93 Difference]: Finished difference Result 10292 states and 15865 transitions. [2019-11-06 22:15:05,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:05,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-11-06 22:15:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:05,198 INFO L225 Difference]: With dead ends: 10292 [2019-11-06 22:15:05,198 INFO L226 Difference]: Without dead ends: 5311 [2019-11-06 22:15:05,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:15:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-11-06 22:15:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-11-06 22:15:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-11-06 22:15:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-11-06 22:15:05,427 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-11-06 22:15:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:05,427 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-11-06 22:15:05,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-11-06 22:15:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-06 22:15:05,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:05,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:05,431 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-11-06 22:15:05,432 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:05,432 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164659623] [2019-11-06 22:15:05,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:05,667 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:15:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:05,690 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164659623] [2019-11-06 22:15:05,691 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:05,691 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:05,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046461292] [2019-11-06 22:15:05,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:05,692 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:05,692 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 4 states. [2019-11-06 22:15:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:07,107 INFO L93 Difference]: Finished difference Result 13935 states and 21751 transitions. [2019-11-06 22:15:07,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:07,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-06 22:15:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:07,127 INFO L225 Difference]: With dead ends: 13935 [2019-11-06 22:15:07,127 INFO L226 Difference]: Without dead ends: 8965 [2019-11-06 22:15:07,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-11-06 22:15:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-11-06 22:15:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-11-06 22:15:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-11-06 22:15:07,511 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-11-06 22:15:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:07,511 INFO L462 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-11-06 22:15:07,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-11-06 22:15:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-06 22:15:07,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:07,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:07,515 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-11-06 22:15:07,516 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:07,516 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743781018] [2019-11-06 22:15:07,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:07,867 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:15:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:07,923 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743781018] [2019-11-06 22:15:07,923 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:07,924 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:07,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797103891] [2019-11-06 22:15:07,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:07,925 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:07,925 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 5 states. [2019-11-06 22:15:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:09,927 INFO L93 Difference]: Finished difference Result 24205 states and 37580 transitions. [2019-11-06 22:15:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:09,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-11-06 22:15:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:09,964 INFO L225 Difference]: With dead ends: 24205 [2019-11-06 22:15:09,965 INFO L226 Difference]: Without dead ends: 15565 [2019-11-06 22:15:09,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:15:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2019-11-06 22:15:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15563. [2019-11-06 22:15:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-11-06 22:15:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23928 transitions. [2019-11-06 22:15:11,176 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23928 transitions. Word has length 114 [2019-11-06 22:15:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:11,176 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23928 transitions. [2019-11-06 22:15:11,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23928 transitions. [2019-11-06 22:15:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-06 22:15:11,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:11,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:11,181 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1996953920, now seen corresponding path program 1 times [2019-11-06 22:15:11,181 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:11,181 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512265779] [2019-11-06 22:15:11,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:11,420 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-11-06 22:15:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:11,440 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512265779] [2019-11-06 22:15:11,440 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:11,440 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:11,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001556532] [2019-11-06 22:15:11,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:11,441 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:11,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:11,442 INFO L87 Difference]: Start difference. First operand 15563 states and 23928 transitions. Second operand 4 states. [2019-11-06 22:15:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:13,553 INFO L93 Difference]: Finished difference Result 46487 states and 71527 transitions. [2019-11-06 22:15:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:13,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-06 22:15:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:13,651 INFO L225 Difference]: With dead ends: 46487 [2019-11-06 22:15:13,651 INFO L226 Difference]: Without dead ends: 31034 [2019-11-06 22:15:13,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31034 states. [2019-11-06 22:15:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31034 to 15569. [2019-11-06 22:15:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15569 states. [2019-11-06 22:15:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15569 states to 15569 states and 23934 transitions. [2019-11-06 22:15:14,581 INFO L78 Accepts]: Start accepts. Automaton has 15569 states and 23934 transitions. Word has length 115 [2019-11-06 22:15:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:14,581 INFO L462 AbstractCegarLoop]: Abstraction has 15569 states and 23934 transitions. [2019-11-06 22:15:14,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 15569 states and 23934 transitions. [2019-11-06 22:15:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-06 22:15:14,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:14,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:14,585 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:14,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1312027809, now seen corresponding path program 1 times [2019-11-06 22:15:14,586 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:14,586 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477699974] [2019-11-06 22:15:14,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY