./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:10:15,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:10:15,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:10:15,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:10:15,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:10:15,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:10:15,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:10:15,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:10:15,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:10:15,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:10:15,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:10:15,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:10:15,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:10:15,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:10:15,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:10:15,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:10:15,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:10:15,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:10:15,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:10:15,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:10:15,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:10:15,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:10:15,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:10:15,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:10:15,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:10:15,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:10:15,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:10:15,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:10:15,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:10:15,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:10:15,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:10:15,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:10:15,134 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:10:15,134 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:10:15,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:10:15,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:10:15,137 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:10:15,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:10:15,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:10:15,155 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:10:15,155 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:10:15,156 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:10:15,156 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:10:15,157 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:10:15,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:10:15,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:10:15,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:10:15,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:10:15,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:10:15,159 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:10:15,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:10:15,159 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:10:15,159 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:10:15,159 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:10:15,160 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:10:15,161 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:10:15,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:10:15,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:10:15,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:10:15,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:10:15,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:15,162 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:10:15,162 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:10:15,162 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:10:15,162 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:10:15,163 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:10:15,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:10:15,164 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-28 16:10:15,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:10:15,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:10:15,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:10:15,237 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:10:15,238 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:10:15,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:15,306 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55f1ee84/7fc4860b9a854fbcbedf9eb748ea5f46/FLAG30200e3e0 [2018-11-28 16:10:15,802 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:10:15,803 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:15,811 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55f1ee84/7fc4860b9a854fbcbedf9eb748ea5f46/FLAG30200e3e0 [2018-11-28 16:10:16,163 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55f1ee84/7fc4860b9a854fbcbedf9eb748ea5f46 [2018-11-28 16:10:16,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:10:16,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:10:16,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:16,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:10:16,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:10:16,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f203e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16, skipping insertion in model container [2018-11-28 16:10:16,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:10:16,217 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:10:16,416 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:16,421 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:10:16,454 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:16,473 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:10:16,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16 WrapperNode [2018-11-28 16:10:16,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:16,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:16,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:10:16,475 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:10:16,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:16,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:10:16,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:10:16,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:10:16,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:10:16,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:10:16,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:10:16,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:10:16,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (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 [2018-11-28 16:10:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:10:16,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:10:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:10:16,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:10:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:10:16,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:10:17,425 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:10:17,425 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:10:17,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:17 BoogieIcfgContainer [2018-11-28 16:10:17,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:10:17,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:10:17,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:10:17,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:10:17,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:10:16" (1/3) ... [2018-11-28 16:10:17,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d303e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:17, skipping insertion in model container [2018-11-28 16:10:17,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (2/3) ... [2018-11-28 16:10:17,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d303e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:17, skipping insertion in model container [2018-11-28 16:10:17,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:17" (3/3) ... [2018-11-28 16:10:17,433 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:17,443 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:10:17,452 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:10:17,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:10:17,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:10:17,498 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:10:17,498 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:10:17,498 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:10:17,498 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:10:17,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:10:17,499 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:10:17,499 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:10:17,499 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:10:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-28 16:10:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:17,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,527 INFO L402 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] [2018-11-28 16:10:17,529 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-11-28 16:10:17,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:17,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,810 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-28 16:10:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,891 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-11-28 16:10:17,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,907 INFO L225 Difference]: With dead ends: 99 [2018-11-28 16:10:17,907 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 16:10:17,910 INFO L631 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 [2018-11-28 16:10:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 16:10:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-11-28 16:10:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 16:10:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-11-28 16:10:17,959 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-11-28 16:10:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:17,959 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-11-28 16:10:17,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-11-28 16:10:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,961 INFO L402 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] [2018-11-28 16:10:17,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-11-28 16:10:17,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,034 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-11-28 16:10:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,093 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-11-28 16:10:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,097 INFO L225 Difference]: With dead ends: 137 [2018-11-28 16:10:18,097 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 16:10:18,098 INFO L631 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 [2018-11-28 16:10:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 16:10:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-28 16:10:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 16:10:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-11-28 16:10:18,111 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-11-28 16:10:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,112 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-11-28 16:10:18,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-11-28 16:10:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,113 INFO L402 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] [2018-11-28 16:10:18,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-11-28 16:10:18,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,179 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-11-28 16:10:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,266 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-11-28 16:10:18,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,269 INFO L225 Difference]: With dead ends: 126 [2018-11-28 16:10:18,269 INFO L226 Difference]: Without dead ends: 87 [2018-11-28 16:10:18,272 INFO L631 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 [2018-11-28 16:10:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-28 16:10:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-28 16:10:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 16:10:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-11-28 16:10:18,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-11-28 16:10:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,291 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-11-28 16:10:18,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-11-28 16:10:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,293 INFO L402 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] [2018-11-28 16:10:18,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-11-28 16:10:18,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,401 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-11-28 16:10:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,496 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-11-28 16:10:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,499 INFO L225 Difference]: With dead ends: 160 [2018-11-28 16:10:18,499 INFO L226 Difference]: Without dead ends: 158 [2018-11-28 16:10:18,500 INFO L631 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 [2018-11-28 16:10:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-28 16:10:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-11-28 16:10:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 16:10:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-11-28 16:10:18,513 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-11-28 16:10:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,514 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-11-28 16:10:18,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-11-28 16:10:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,515 INFO L402 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] [2018-11-28 16:10:18,516 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-11-28 16:10:18,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,604 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-11-28 16:10:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,663 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-11-28 16:10:18,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,665 INFO L225 Difference]: With dead ends: 264 [2018-11-28 16:10:18,666 INFO L226 Difference]: Without dead ends: 160 [2018-11-28 16:10:18,667 INFO L631 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 [2018-11-28 16:10:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-28 16:10:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-28 16:10:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-28 16:10:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-11-28 16:10:18,682 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-11-28 16:10:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,682 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-11-28 16:10:18,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-11-28 16:10:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:18,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,684 INFO L402 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] [2018-11-28 16:10:18,684 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,685 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-11-28 16:10:18,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,767 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-11-28 16:10:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,856 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-11-28 16:10:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,858 INFO L225 Difference]: With dead ends: 237 [2018-11-28 16:10:18,859 INFO L226 Difference]: Without dead ends: 162 [2018-11-28 16:10:18,861 INFO L631 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 [2018-11-28 16:10:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-28 16:10:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-28 16:10:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-28 16:10:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-11-28 16:10:18,884 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-11-28 16:10:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,885 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-11-28 16:10:18,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-11-28 16:10:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:18,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,886 INFO L402 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] [2018-11-28 16:10:18,887 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-11-28 16:10:18,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,977 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-11-28 16:10:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,031 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-11-28 16:10:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,035 INFO L225 Difference]: With dead ends: 300 [2018-11-28 16:10:19,036 INFO L226 Difference]: Without dead ends: 298 [2018-11-28 16:10:19,036 INFO L631 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 [2018-11-28 16:10:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-28 16:10:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-11-28 16:10:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-28 16:10:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-11-28 16:10:19,051 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-11-28 16:10:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,052 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-11-28 16:10:19,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-11-28 16:10:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:19,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,055 INFO L402 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] [2018-11-28 16:10:19,056 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-11-28 16:10:19,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,138 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-11-28 16:10:19,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,249 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-11-28 16:10:19,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,252 INFO L225 Difference]: With dead ends: 512 [2018-11-28 16:10:19,253 INFO L226 Difference]: Without dead ends: 306 [2018-11-28 16:10:19,255 INFO L631 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 [2018-11-28 16:10:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-28 16:10:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-28 16:10:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-28 16:10:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-11-28 16:10:19,272 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-11-28 16:10:19,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,272 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-11-28 16:10:19,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-11-28 16:10:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:19,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,276 INFO L402 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] [2018-11-28 16:10:19,276 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-11-28 16:10:19,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,360 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-11-28 16:10:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,455 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-11-28 16:10:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,458 INFO L225 Difference]: With dead ends: 456 [2018-11-28 16:10:19,458 INFO L226 Difference]: Without dead ends: 310 [2018-11-28 16:10:19,459 INFO L631 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 [2018-11-28 16:10:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-28 16:10:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-11-28 16:10:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-28 16:10:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-11-28 16:10:19,473 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-11-28 16:10:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,474 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-11-28 16:10:19,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-11-28 16:10:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:19,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,476 INFO L402 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] [2018-11-28 16:10:19,476 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-11-28 16:10:19,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,572 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-11-28 16:10:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,652 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-11-28 16:10:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,663 INFO L225 Difference]: With dead ends: 572 [2018-11-28 16:10:19,663 INFO L226 Difference]: Without dead ends: 570 [2018-11-28 16:10:19,664 INFO L631 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 [2018-11-28 16:10:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-28 16:10:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-11-28 16:10:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-28 16:10:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-11-28 16:10:19,686 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-11-28 16:10:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,687 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-11-28 16:10:19,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-11-28 16:10:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:19,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,689 INFO L402 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] [2018-11-28 16:10:19,689 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-11-28 16:10:19,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,771 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-11-28 16:10:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,879 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-11-28 16:10:19,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,884 INFO L225 Difference]: With dead ends: 1004 [2018-11-28 16:10:19,885 INFO L226 Difference]: Without dead ends: 594 [2018-11-28 16:10:19,886 INFO L631 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 [2018-11-28 16:10:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-28 16:10:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-11-28 16:10:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-28 16:10:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-11-28 16:10:19,912 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-11-28 16:10:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,913 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-11-28 16:10:19,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-11-28 16:10:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:19,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,916 INFO L402 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] [2018-11-28 16:10:19,917 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-11-28 16:10:19,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,994 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-11-28 16:10:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,090 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-11-28 16:10:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,096 INFO L225 Difference]: With dead ends: 888 [2018-11-28 16:10:20,096 INFO L226 Difference]: Without dead ends: 602 [2018-11-28 16:10:20,097 INFO L631 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 [2018-11-28 16:10:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-28 16:10:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-28 16:10:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-28 16:10:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-11-28 16:10:20,123 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-11-28 16:10:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,123 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-11-28 16:10:20,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-11-28 16:10:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:20,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,126 INFO L402 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] [2018-11-28 16:10:20,127 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-11-28 16:10:20,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,202 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-11-28 16:10:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,306 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-11-28 16:10:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,316 INFO L225 Difference]: With dead ends: 1100 [2018-11-28 16:10:20,317 INFO L226 Difference]: Without dead ends: 1098 [2018-11-28 16:10:20,318 INFO L631 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 [2018-11-28 16:10:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-11-28 16:10:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-11-28 16:10:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-28 16:10:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-11-28 16:10:20,357 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-11-28 16:10:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,357 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-11-28 16:10:20,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-11-28 16:10:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:20,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,361 INFO L402 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] [2018-11-28 16:10:20,363 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-11-28 16:10:20,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,437 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-11-28 16:10:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,566 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-11-28 16:10:20,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,574 INFO L225 Difference]: With dead ends: 1980 [2018-11-28 16:10:20,575 INFO L226 Difference]: Without dead ends: 1162 [2018-11-28 16:10:20,577 INFO L631 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 [2018-11-28 16:10:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-28 16:10:20,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-11-28 16:10:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-28 16:10:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-11-28 16:10:20,625 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-11-28 16:10:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,625 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-11-28 16:10:20,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-11-28 16:10:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:20,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,629 INFO L402 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] [2018-11-28 16:10:20,629 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,630 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-11-28 16:10:20,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,703 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-11-28 16:10:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,793 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-11-28 16:10:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,802 INFO L225 Difference]: With dead ends: 1740 [2018-11-28 16:10:20,802 INFO L226 Difference]: Without dead ends: 1178 [2018-11-28 16:10:20,804 INFO L631 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 [2018-11-28 16:10:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-11-28 16:10:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-11-28 16:10:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-28 16:10:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-11-28 16:10:20,853 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-11-28 16:10:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,853 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-11-28 16:10:20,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-11-28 16:10:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:20,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,857 INFO L402 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] [2018-11-28 16:10:20,858 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-11-28 16:10:20,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,930 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-11-28 16:10:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,049 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-11-28 16:10:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,061 INFO L225 Difference]: With dead ends: 2124 [2018-11-28 16:10:21,061 INFO L226 Difference]: Without dead ends: 2122 [2018-11-28 16:10:21,062 INFO L631 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 [2018-11-28 16:10:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-28 16:10:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-11-28 16:10:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-11-28 16:10:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-11-28 16:10:21,119 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-11-28 16:10:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,119 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-11-28 16:10:21,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-11-28 16:10:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:21,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,122 INFO L402 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] [2018-11-28 16:10:21,123 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-11-28 16:10:21,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:21,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,190 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-11-28 16:10:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,341 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-11-28 16:10:21,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,352 INFO L225 Difference]: With dead ends: 3916 [2018-11-28 16:10:21,353 INFO L226 Difference]: Without dead ends: 2282 [2018-11-28 16:10:21,357 INFO L631 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 [2018-11-28 16:10:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-11-28 16:10:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-11-28 16:10:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-11-28 16:10:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-11-28 16:10:21,445 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-11-28 16:10:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,446 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-11-28 16:10:21,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-11-28 16:10:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:21,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,450 INFO L402 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] [2018-11-28 16:10:21,451 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-11-28 16:10:21,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:21,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,522 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-11-28 16:10:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,687 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-11-28 16:10:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,699 INFO L225 Difference]: With dead ends: 3420 [2018-11-28 16:10:21,699 INFO L226 Difference]: Without dead ends: 2314 [2018-11-28 16:10:21,701 INFO L631 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 [2018-11-28 16:10:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-28 16:10:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-11-28 16:10:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-28 16:10:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-11-28 16:10:21,781 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-11-28 16:10:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,782 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-11-28 16:10:21,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-11-28 16:10:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:21,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,785 INFO L402 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] [2018-11-28 16:10:21,785 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-11-28 16:10:21,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:21,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,854 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-11-28 16:10:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:22,008 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-11-28 16:10:22,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:22,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:22,027 INFO L225 Difference]: With dead ends: 4108 [2018-11-28 16:10:22,028 INFO L226 Difference]: Without dead ends: 4106 [2018-11-28 16:10:22,030 INFO L631 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 [2018-11-28 16:10:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-28 16:10:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-11-28 16:10:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-28 16:10:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-11-28 16:10:22,136 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-11-28 16:10:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:22,136 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-11-28 16:10:22,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-11-28 16:10:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:22,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:22,141 INFO L402 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] [2018-11-28 16:10:22,141 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:22,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-11-28 16:10:22,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:22,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:22,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:22,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:22,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:22,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:22,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,207 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-11-28 16:10:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:22,379 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-11-28 16:10:22,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:22,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:22,401 INFO L225 Difference]: With dead ends: 7756 [2018-11-28 16:10:22,401 INFO L226 Difference]: Without dead ends: 4490 [2018-11-28 16:10:22,408 INFO L631 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 [2018-11-28 16:10:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-28 16:10:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-11-28 16:10:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-11-28 16:10:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-11-28 16:10:22,557 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-11-28 16:10:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:22,557 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-11-28 16:10:22,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-11-28 16:10:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:22,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:22,563 INFO L402 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] [2018-11-28 16:10:22,563 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:22,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-11-28 16:10:22,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:22,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:22,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:22,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,633 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-11-28 16:10:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:22,795 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-11-28 16:10:22,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:22,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:22,833 INFO L225 Difference]: With dead ends: 6732 [2018-11-28 16:10:22,833 INFO L226 Difference]: Without dead ends: 4554 [2018-11-28 16:10:22,844 INFO L631 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 [2018-11-28 16:10:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-28 16:10:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-11-28 16:10:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-11-28 16:10:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-11-28 16:10:23,002 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-11-28 16:10:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:23,002 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-11-28 16:10:23,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-11-28 16:10:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:23,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:23,008 INFO L402 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] [2018-11-28 16:10:23,009 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:23,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-11-28 16:10:23,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:23,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:23,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:23,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:23,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:23,086 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-11-28 16:10:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:23,327 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-11-28 16:10:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:23,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:23,354 INFO L225 Difference]: With dead ends: 13260 [2018-11-28 16:10:23,354 INFO L226 Difference]: Without dead ends: 8842 [2018-11-28 16:10:23,365 INFO L631 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 [2018-11-28 16:10:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-11-28 16:10:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-11-28 16:10:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-28 16:10:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-11-28 16:10:23,682 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-11-28 16:10:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:23,682 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-11-28 16:10:23,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-11-28 16:10:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:23,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:23,693 INFO L402 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] [2018-11-28 16:10:23,693 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:23,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-11-28 16:10:23,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:23,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:23,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:23,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:23,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:23,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:23,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:23,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:23,778 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-11-28 16:10:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:24,080 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-11-28 16:10:24,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:24,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:24,100 INFO L225 Difference]: With dead ends: 10124 [2018-11-28 16:10:24,100 INFO L226 Difference]: Without dead ends: 10122 [2018-11-28 16:10:24,103 INFO L631 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 [2018-11-28 16:10:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-11-28 16:10:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-11-28 16:10:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-28 16:10:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-11-28 16:10:24,359 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-11-28 16:10:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:24,360 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-11-28 16:10:24,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-11-28 16:10:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 16:10:24,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:24,370 INFO L402 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] [2018-11-28 16:10:24,371 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:24,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-11-28 16:10:24,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:24,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:24,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:24,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:24,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:24,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:24,445 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-11-28 16:10:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:24,800 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-11-28 16:10:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:24,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 16:10:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:24,829 INFO L225 Difference]: With dead ends: 15244 [2018-11-28 16:10:24,830 INFO L226 Difference]: Without dead ends: 15242 [2018-11-28 16:10:24,837 INFO L631 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 [2018-11-28 16:10:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-11-28 16:10:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-11-28 16:10:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-11-28 16:10:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-11-28 16:10:25,158 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-11-28 16:10:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,158 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-11-28 16:10:25,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-11-28 16:10:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 16:10:25,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,177 INFO L402 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] [2018-11-28 16:10:25,177 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,178 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-11-28 16:10:25,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,246 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-11-28 16:10:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,773 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-11-28 16:10:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 16:10:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,806 INFO L225 Difference]: With dead ends: 30348 [2018-11-28 16:10:25,807 INFO L226 Difference]: Without dead ends: 17290 [2018-11-28 16:10:25,829 INFO L631 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 [2018-11-28 16:10:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-11-28 16:10:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-11-28 16:10:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-11-28 16:10:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-11-28 16:10:26,280 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-11-28 16:10:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,280 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-11-28 16:10:26,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-11-28 16:10:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:10:26,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:26,302 INFO L402 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] [2018-11-28 16:10:26,302 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:26,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-11-28 16:10:26,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:26,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:26,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:26,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:26,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:26,369 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-11-28 16:10:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,728 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-11-28 16:10:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 16:10:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:26,766 INFO L225 Difference]: With dead ends: 26124 [2018-11-28 16:10:26,766 INFO L226 Difference]: Without dead ends: 17674 [2018-11-28 16:10:26,790 INFO L631 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 [2018-11-28 16:10:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-11-28 16:10:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-11-28 16:10:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-11-28 16:10:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-11-28 16:10:27,353 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-11-28 16:10:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:27,353 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-11-28 16:10:27,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-11-28 16:10:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:10:27,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:27,375 INFO L402 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] [2018-11-28 16:10:27,375 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:27,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:27,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-11-28 16:10:27,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:27,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:27,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:27,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:27,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:27,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:27,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:27,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:27,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:27,446 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-11-28 16:10:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:27,991 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-11-28 16:10:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:27,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 16:10:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:28,055 INFO L225 Difference]: With dead ends: 29708 [2018-11-28 16:10:28,056 INFO L226 Difference]: Without dead ends: 29706 [2018-11-28 16:10:28,068 INFO L631 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 [2018-11-28 16:10:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-11-28 16:10:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-11-28 16:10:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-11-28 16:10:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-11-28 16:10:28,664 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-11-28 16:10:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:28,665 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-11-28 16:10:28,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-11-28 16:10:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:10:28,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:28,702 INFO L402 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] [2018-11-28 16:10:28,703 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:28,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-11-28 16:10:28,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:28,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:28,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:28,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:28,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:28,770 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-11-28 16:10:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:29,603 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-11-28 16:10:29,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:29,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 16:10:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:29,648 INFO L225 Difference]: With dead ends: 60428 [2018-11-28 16:10:29,648 INFO L226 Difference]: Without dead ends: 34314 [2018-11-28 16:10:29,694 INFO L631 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 [2018-11-28 16:10:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-11-28 16:10:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-11-28 16:10:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-11-28 16:10:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-11-28 16:10:30,554 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-11-28 16:10:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:30,554 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-11-28 16:10:30,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-11-28 16:10:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 16:10:30,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:30,576 INFO L402 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] [2018-11-28 16:10:30,578 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:30,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-11-28 16:10:30,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:30,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:30,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:30,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:30,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:30,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:30,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:30,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:30,644 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-11-28 16:10:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:31,463 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-11-28 16:10:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:31,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 16:10:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:31,509 INFO L225 Difference]: With dead ends: 51468 [2018-11-28 16:10:31,509 INFO L226 Difference]: Without dead ends: 34826 [2018-11-28 16:10:31,532 INFO L631 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 [2018-11-28 16:10:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-11-28 16:10:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-11-28 16:10:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-11-28 16:10:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-11-28 16:10:32,248 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-11-28 16:10:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,248 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-11-28 16:10:32,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-11-28 16:10:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 16:10:32,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,263 INFO L402 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] [2018-11-28 16:10:32,263 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-11-28 16:10:32,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:32,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,326 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-11-28 16:10:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,215 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-11-28 16:10:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 16:10:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,280 INFO L225 Difference]: With dead ends: 57356 [2018-11-28 16:10:33,280 INFO L226 Difference]: Without dead ends: 57354 [2018-11-28 16:10:33,300 INFO L631 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 [2018-11-28 16:10:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-11-28 16:10:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-11-28 16:10:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-11-28 16:10:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-11-28 16:10:34,733 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-11-28 16:10:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,733 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-11-28 16:10:34,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-11-28 16:10:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 16:10:34,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:34,770 INFO L402 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] [2018-11-28 16:10:34,770 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:34,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-11-28 16:10:34,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:34,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:34,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:34,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:34,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:34,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:34,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,835 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-11-28 16:10:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:35,863 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-11-28 16:10:35,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:35,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-28 16:10:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:35,946 INFO L225 Difference]: With dead ends: 119820 [2018-11-28 16:10:35,946 INFO L226 Difference]: Without dead ends: 67594 [2018-11-28 16:10:36,008 INFO L631 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 [2018-11-28 16:10:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-11-28 16:10:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-11-28 16:10:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-11-28 16:10:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-11-28 16:10:38,252 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-11-28 16:10:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:38,253 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-11-28 16:10:38,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-11-28 16:10:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 16:10:38,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:38,285 INFO L402 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] [2018-11-28 16:10:38,285 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:38,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:38,285 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-11-28 16:10:38,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:38,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:38,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:38,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:38,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:38,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:38,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:38,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:38,350 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-11-28 16:10:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:39,301 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-11-28 16:10:39,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:39,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 16:10:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:39,370 INFO L225 Difference]: With dead ends: 101388 [2018-11-28 16:10:39,371 INFO L226 Difference]: Without dead ends: 68618 [2018-11-28 16:10:39,411 INFO L631 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 [2018-11-28 16:10:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-11-28 16:10:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-11-28 16:10:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-11-28 16:10:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-11-28 16:10:41,718 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-11-28 16:10:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:41,719 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-11-28 16:10:41,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-11-28 16:10:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 16:10:41,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:41,750 INFO L402 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] [2018-11-28 16:10:41,751 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:41,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:41,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-11-28 16:10:41,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:41,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:41,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:41,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:41,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:41,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:41,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:41,830 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-11-28 16:10:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:43,360 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-11-28 16:10:43,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:43,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 16:10:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:43,464 INFO L225 Difference]: With dead ends: 110602 [2018-11-28 16:10:43,464 INFO L226 Difference]: Without dead ends: 110600 [2018-11-28 16:10:43,491 INFO L631 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 [2018-11-28 16:10:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-11-28 16:10:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-11-28 16:10:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-11-28 16:10:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-11-28 16:10:45,991 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-11-28 16:10:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:45,992 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-11-28 16:10:45,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-11-28 16:10:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 16:10:46,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:46,048 INFO L402 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] [2018-11-28 16:10:46,049 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:46,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-11-28 16:10:46,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:46,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:46,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:46,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:46,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:46,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:46,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:46,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:46,119 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-11-28 16:10:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:48,343 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-11-28 16:10:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:48,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 16:10:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:48,344 INFO L225 Difference]: With dead ends: 237576 [2018-11-28 16:10:48,344 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:48,512 INFO L631 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 [2018-11-28 16:10:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:48,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-28 16:10:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:48,513 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:48,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:48,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:48,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:48,645 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:48,645 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:48,647 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:48,647 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,647 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-28 16:10:48,649 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,650 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,650 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-28 16:10:48,650 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-28 16:10:48,650 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-28 16:10:48,650 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-28 16:10:48,650 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,651 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,653 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,654 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,654 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-28 16:10:48,654 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-28 16:10:48,654 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,654 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-28 16:10:48,654 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,654 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-28 16:10:48,655 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-28 16:10:48,655 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,655 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,655 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-28 16:10:48,655 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,655 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,655 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-28 16:10:48,655 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-28 16:10:48,660 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,660 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,660 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-28 16:10:48,660 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-28 16:10:48,660 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-28 16:10:48,660 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,661 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-28 16:10:48,662 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-28 16:10:48,662 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-28 16:10:48,662 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-28 16:10:48,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:48 BoogieIcfgContainer [2018-11-28 16:10:48,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:48,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:48,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:48,683 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:48,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:17" (3/4) ... [2018-11-28 16:10:48,692 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:48,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:48,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:48,711 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 16:10:48,712 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:10:48,712 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:48,806 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:48,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:48,807 INFO L168 Benchmark]: Toolchain (without parser) took 32639.33 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 952.7 MB in the beginning and 310.5 MB in the end (delta: 642.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-11-28 16:10:48,811 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:48,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:48,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.66 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:48,813 INFO L168 Benchmark]: Boogie Preprocessor took 64.32 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:48,813 INFO L168 Benchmark]: RCFGBuilder took 847.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:48,815 INFO L168 Benchmark]: TraceAbstraction took 31256.00 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 313.0 MB in the end (delta: 782.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-28 16:10:48,816 INFO L168 Benchmark]: Witness Printer took 123.53 ms. Allocated memory is still 3.3 GB. Free memory was 313.0 MB in the beginning and 310.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:48,820 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.57 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.66 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.32 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 847.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31256.00 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 313.0 MB in the end (delta: 782.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 123.53 ms. Allocated memory is still 3.3 GB. Free memory was 313.0 MB in the beginning and 310.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 31.1s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 14.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...