./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/locks/test_locks_12.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.25-f470102 [2019-11-28 15:40:23,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:23,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:23,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:23,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:23,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:23,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:23,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:23,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:23,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:23,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:23,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:23,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:23,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:23,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:23,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:23,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:23,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:23,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:23,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:23,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:23,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:23,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:23,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:23,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:23,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:23,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:23,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:23,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:23,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:23,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:23,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:23,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:23,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:23,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:23,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:23,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:23,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:23,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:23,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:23,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:23,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:23,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:23,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:23,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:23,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:23,329 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:23,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:23,329 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:23,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:23,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:23,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:23,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:23,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:23,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:23,331 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:23,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:23,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:23,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:23,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:23,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:23,334 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:23,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:23,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:23,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:23,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:23,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:23,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:23,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:23,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:23,337 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:23,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2019-11-28 15:40:23,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:23,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:23,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:23,719 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:23,720 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:23,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2019-11-28 15:40:23,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dde8ecb3/567eac5e47d8450cb208009296a24d5c/FLAGcaefe829d [2019-11-28 15:40:24,199 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:24,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2019-11-28 15:40:24,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dde8ecb3/567eac5e47d8450cb208009296a24d5c/FLAGcaefe829d [2019-11-28 15:40:24,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dde8ecb3/567eac5e47d8450cb208009296a24d5c [2019-11-28 15:40:24,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:24,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:24,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:24,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:24,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:24,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:24" (1/1) ... [2019-11-28 15:40:24,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600cef8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:24, skipping insertion in model container [2019-11-28 15:40:24,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:24" (1/1) ... [2019-11-28 15:40:24,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:24,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:24,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:24,909 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:24,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:25,030 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:25,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25 WrapperNode [2019-11-28 15:40:25,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:25,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:25,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:25,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:25,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:25,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:25,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:25,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:25,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... [2019-11-28 15:40:25,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:25,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:25,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:25,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:25,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:25,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:25,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:25,533 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:25,534 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:25,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:25 BoogieIcfgContainer [2019-11-28 15:40:25,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:25,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:25,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:25,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:25,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:24" (1/3) ... [2019-11-28 15:40:25,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14344d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:25, skipping insertion in model container [2019-11-28 15:40:25,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:25" (2/3) ... [2019-11-28 15:40:25,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14344d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:25, skipping insertion in model container [2019-11-28 15:40:25,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:25" (3/3) ... [2019-11-28 15:40:25,551 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-28 15:40:25,560 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:25,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:25,575 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:25,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:25,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:25,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:25,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:25,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:25,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:25,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:25,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-28 15:40:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:25,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:25,625 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-11-28 15:40:25,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839153292] [2019-11-28 15:40:25,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:25,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839153292] [2019-11-28 15:40:25,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:25,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:25,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109293667] [2019-11-28 15:40:25,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:25,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,861 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-28 15:40:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:25,925 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-11-28 15:40:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:25,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:25,939 INFO L225 Difference]: With dead ends: 94 [2019-11-28 15:40:25,939 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 15:40:25,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 15:40:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-28 15:40:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 15:40:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-11-28 15:40:25,985 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-11-28 15:40:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:25,986 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-11-28 15:40:25,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-11-28 15:40:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:25,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:25,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:25,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-11-28 15:40:25,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:25,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699845796] [2019-11-28 15:40:25,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699845796] [2019-11-28 15:40:26,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070619267] [2019-11-28 15:40:26,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,067 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-11-28 15:40:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,117 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-11-28 15:40:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,122 INFO L225 Difference]: With dead ends: 133 [2019-11-28 15:40:26,123 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 15:40:26,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 15:40:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-28 15:40:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 15:40:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-11-28 15:40:26,138 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-11-28 15:40:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,139 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-11-28 15:40:26,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-11-28 15:40:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:26,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,140 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-11-28 15:40:26,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542591419] [2019-11-28 15:40:26,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542591419] [2019-11-28 15:40:26,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619718271] [2019-11-28 15:40:26,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,222 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-11-28 15:40:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,263 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-11-28 15:40:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,268 INFO L225 Difference]: With dead ends: 122 [2019-11-28 15:40:26,268 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 15:40:26,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 15:40:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-28 15:40:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 15:40:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-11-28 15:40:26,281 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-11-28 15:40:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,281 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-11-28 15:40:26,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-11-28 15:40:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:26,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,283 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-11-28 15:40:26,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310799438] [2019-11-28 15:40:26,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310799438] [2019-11-28 15:40:26,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236811250] [2019-11-28 15:40:26,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,360 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-11-28 15:40:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,383 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-11-28 15:40:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,385 INFO L225 Difference]: With dead ends: 156 [2019-11-28 15:40:26,386 INFO L226 Difference]: Without dead ends: 154 [2019-11-28 15:40:26,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-28 15:40:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-11-28 15:40:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 15:40:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-11-28 15:40:26,402 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-11-28 15:40:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,404 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-11-28 15:40:26,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-11-28 15:40:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:26,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,406 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-11-28 15:40:26,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919824108] [2019-11-28 15:40:26,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919824108] [2019-11-28 15:40:26,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166252796] [2019-11-28 15:40:26,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,466 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-11-28 15:40:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,491 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-11-28 15:40:26,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,493 INFO L225 Difference]: With dead ends: 260 [2019-11-28 15:40:26,494 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 15:40:26,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 15:40:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-28 15:40:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 15:40:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-11-28 15:40:26,514 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-11-28 15:40:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,514 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-11-28 15:40:26,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-11-28 15:40:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:26,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,517 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-11-28 15:40:26,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975551857] [2019-11-28 15:40:26,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975551857] [2019-11-28 15:40:26,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722602405] [2019-11-28 15:40:26,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,561 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-11-28 15:40:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,581 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-11-28 15:40:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,583 INFO L225 Difference]: With dead ends: 233 [2019-11-28 15:40:26,583 INFO L226 Difference]: Without dead ends: 158 [2019-11-28 15:40:26,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-28 15:40:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-28 15:40:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 15:40:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-11-28 15:40:26,597 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-11-28 15:40:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,597 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-11-28 15:40:26,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-11-28 15:40:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:26,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,599 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-11-28 15:40:26,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390598854] [2019-11-28 15:40:26,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390598854] [2019-11-28 15:40:26,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264583176] [2019-11-28 15:40:26,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,637 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-11-28 15:40:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,672 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-11-28 15:40:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,675 INFO L225 Difference]: With dead ends: 452 [2019-11-28 15:40:26,675 INFO L226 Difference]: Without dead ends: 302 [2019-11-28 15:40:26,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-28 15:40:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-28 15:40:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-28 15:40:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-11-28 15:40:26,693 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-11-28 15:40:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,694 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-11-28 15:40:26,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-11-28 15:40:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 15:40:26,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,696 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-11-28 15:40:26,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102527506] [2019-11-28 15:40:26,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102527506] [2019-11-28 15:40:26,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747430960] [2019-11-28 15:40:26,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,745 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-11-28 15:40:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,776 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-11-28 15:40:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 15:40:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,782 INFO L225 Difference]: With dead ends: 384 [2019-11-28 15:40:26,783 INFO L226 Difference]: Without dead ends: 382 [2019-11-28 15:40:26,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-28 15:40:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-11-28 15:40:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-28 15:40:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-11-28 15:40:26,805 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-11-28 15:40:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,806 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-11-28 15:40:26,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-11-28 15:40:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:26,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,813 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-11-28 15:40:26,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511096452] [2019-11-28 15:40:26,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511096452] [2019-11-28 15:40:26,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678472098] [2019-11-28 15:40:26,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,869 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-11-28 15:40:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,892 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-11-28 15:40:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,896 INFO L225 Difference]: With dead ends: 564 [2019-11-28 15:40:26,896 INFO L226 Difference]: Without dead ends: 562 [2019-11-28 15:40:26,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-28 15:40:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-11-28 15:40:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-28 15:40:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-11-28 15:40:26,914 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-11-28 15:40:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:26,914 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-11-28 15:40:26,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-11-28 15:40:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 15:40:26,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:26,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:26,916 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-11-28 15:40:26,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:26,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973650429] [2019-11-28 15:40:26,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:26,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973650429] [2019-11-28 15:40:26,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:26,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:26,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092613722] [2019-11-28 15:40:26,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:26,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:26,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:26,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,949 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-11-28 15:40:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:26,973 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-11-28 15:40:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:26,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 15:40:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:26,977 INFO L225 Difference]: With dead ends: 996 [2019-11-28 15:40:26,977 INFO L226 Difference]: Without dead ends: 586 [2019-11-28 15:40:26,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-28 15:40:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-28 15:40:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-28 15:40:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-11-28 15:40:27,000 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-11-28 15:40:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,001 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-11-28 15:40:27,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-11-28 15:40:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:27,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,004 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-11-28 15:40:27,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323440519] [2019-11-28 15:40:27,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323440519] [2019-11-28 15:40:27,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255387227] [2019-11-28 15:40:27,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,037 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-11-28 15:40:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,062 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-11-28 15:40:27,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,066 INFO L225 Difference]: With dead ends: 884 [2019-11-28 15:40:27,066 INFO L226 Difference]: Without dead ends: 598 [2019-11-28 15:40:27,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-28 15:40:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-28 15:40:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-28 15:40:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-11-28 15:40:27,087 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-11-28 15:40:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,087 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-11-28 15:40:27,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-11-28 15:40:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:27,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-11-28 15:40:27,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611702751] [2019-11-28 15:40:27,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611702751] [2019-11-28 15:40:27,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450008643] [2019-11-28 15:40:27,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,133 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-11-28 15:40:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,161 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-11-28 15:40:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,169 INFO L225 Difference]: With dead ends: 1096 [2019-11-28 15:40:27,169 INFO L226 Difference]: Without dead ends: 1094 [2019-11-28 15:40:27,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-11-28 15:40:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-11-28 15:40:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-28 15:40:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-11-28 15:40:27,197 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-11-28 15:40:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,197 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-11-28 15:40:27,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-11-28 15:40:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:27,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,199 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-11-28 15:40:27,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262075030] [2019-11-28 15:40:27,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262075030] [2019-11-28 15:40:27,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827556001] [2019-11-28 15:40:27,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,224 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-11-28 15:40:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,255 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-11-28 15:40:27,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,262 INFO L225 Difference]: With dead ends: 1976 [2019-11-28 15:40:27,262 INFO L226 Difference]: Without dead ends: 1158 [2019-11-28 15:40:27,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-28 15:40:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-11-28 15:40:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-28 15:40:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-11-28 15:40:27,299 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-11-28 15:40:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,299 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-11-28 15:40:27,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-11-28 15:40:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:27,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,302 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-11-28 15:40:27,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476127391] [2019-11-28 15:40:27,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476127391] [2019-11-28 15:40:27,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063434213] [2019-11-28 15:40:27,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,331 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-11-28 15:40:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,360 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-11-28 15:40:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,367 INFO L225 Difference]: With dead ends: 1736 [2019-11-28 15:40:27,367 INFO L226 Difference]: Without dead ends: 1174 [2019-11-28 15:40:27,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-28 15:40:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-11-28 15:40:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-11-28 15:40:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-11-28 15:40:27,407 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-11-28 15:40:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,408 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-11-28 15:40:27,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-11-28 15:40:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:27,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,411 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-11-28 15:40:27,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567638759] [2019-11-28 15:40:27,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567638759] [2019-11-28 15:40:27,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149530584] [2019-11-28 15:40:27,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,447 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-11-28 15:40:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,486 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-11-28 15:40:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,498 INFO L225 Difference]: With dead ends: 2120 [2019-11-28 15:40:27,498 INFO L226 Difference]: Without dead ends: 2118 [2019-11-28 15:40:27,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-28 15:40:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-11-28 15:40:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-28 15:40:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-11-28 15:40:27,556 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-11-28 15:40:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,556 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-11-28 15:40:27,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-11-28 15:40:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:27,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,559 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-11-28 15:40:27,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66328271] [2019-11-28 15:40:27,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66328271] [2019-11-28 15:40:27,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272867010] [2019-11-28 15:40:27,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,597 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-11-28 15:40:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,666 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-11-28 15:40:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,681 INFO L225 Difference]: With dead ends: 3912 [2019-11-28 15:40:27,681 INFO L226 Difference]: Without dead ends: 2278 [2019-11-28 15:40:27,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-11-28 15:40:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-11-28 15:40:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-11-28 15:40:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-11-28 15:40:27,778 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-11-28 15:40:27,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,779 INFO L462 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-11-28 15:40:27,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-11-28 15:40:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:27,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:27,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:27,784 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-11-28 15:40:27,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:27,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192674640] [2019-11-28 15:40:27,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:27,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192674640] [2019-11-28 15:40:27,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:27,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:27,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064811451] [2019-11-28 15:40:27,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:27,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:27,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,821 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-11-28 15:40:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:27,876 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-11-28 15:40:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:27,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:27,891 INFO L225 Difference]: With dead ends: 3416 [2019-11-28 15:40:27,891 INFO L226 Difference]: Without dead ends: 2310 [2019-11-28 15:40:27,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-28 15:40:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-11-28 15:40:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-11-28 15:40:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-11-28 15:40:27,998 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-11-28 15:40:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:27,999 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-11-28 15:40:27,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-11-28 15:40:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:28,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:28,002 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-11-28 15:40:28,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035710441] [2019-11-28 15:40:28,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:28,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035710441] [2019-11-28 15:40:28,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117863223] [2019-11-28 15:40:28,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,036 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-11-28 15:40:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,095 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-11-28 15:40:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,116 INFO L225 Difference]: With dead ends: 4104 [2019-11-28 15:40:28,116 INFO L226 Difference]: Without dead ends: 4102 [2019-11-28 15:40:28,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-28 15:40:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-11-28 15:40:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-28 15:40:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-11-28 15:40:28,243 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-11-28 15:40:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,243 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-11-28 15:40:28,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-11-28 15:40:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:28,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:28,254 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-11-28 15:40:28,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060683055] [2019-11-28 15:40:28,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:28,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060683055] [2019-11-28 15:40:28,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707950484] [2019-11-28 15:40:28,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,281 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-11-28 15:40:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,399 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-11-28 15:40:28,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,421 INFO L225 Difference]: With dead ends: 7752 [2019-11-28 15:40:28,421 INFO L226 Difference]: Without dead ends: 4486 [2019-11-28 15:40:28,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-28 15:40:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-11-28 15:40:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-11-28 15:40:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-11-28 15:40:28,567 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-11-28 15:40:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,567 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-11-28 15:40:28,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-11-28 15:40:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:28,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:28,573 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,573 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-11-28 15:40:28,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179955540] [2019-11-28 15:40:28,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:28,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179955540] [2019-11-28 15:40:28,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071721714] [2019-11-28 15:40:28,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,599 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-11-28 15:40:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,674 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-11-28 15:40:28,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:28,699 INFO L225 Difference]: With dead ends: 6728 [2019-11-28 15:40:28,699 INFO L226 Difference]: Without dead ends: 4550 [2019-11-28 15:40:28,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-11-28 15:40:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-11-28 15:40:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-11-28 15:40:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-11-28 15:40:28,835 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-11-28 15:40:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:28,836 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-11-28 15:40:28,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-11-28 15:40:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:28,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:28,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:28,842 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-11-28 15:40:28,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:28,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930603750] [2019-11-28 15:40:28,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:28,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930603750] [2019-11-28 15:40:28,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:28,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:28,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149399798] [2019-11-28 15:40:28,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:28,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:28,876 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-11-28 15:40:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:28,998 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-11-28 15:40:28,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:28,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,025 INFO L225 Difference]: With dead ends: 7944 [2019-11-28 15:40:29,026 INFO L226 Difference]: Without dead ends: 7942 [2019-11-28 15:40:29,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-11-28 15:40:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-11-28 15:40:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-28 15:40:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-11-28 15:40:29,197 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-11-28 15:40:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,198 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-11-28 15:40:29,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-11-28 15:40:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:29,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:29,210 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-11-28 15:40:29,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:29,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93765993] [2019-11-28 15:40:29,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:29,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93765993] [2019-11-28 15:40:29,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:29,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008530077] [2019-11-28 15:40:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:29,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,233 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-11-28 15:40:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:29,396 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-11-28 15:40:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:29,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,417 INFO L225 Difference]: With dead ends: 15368 [2019-11-28 15:40:29,417 INFO L226 Difference]: Without dead ends: 8838 [2019-11-28 15:40:29,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-11-28 15:40:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-11-28 15:40:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-11-28 15:40:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-11-28 15:40:29,716 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-11-28 15:40:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:29,717 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-11-28 15:40:29,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-11-28 15:40:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:29,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:29,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:29,730 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-11-28 15:40:29,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:29,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203446035] [2019-11-28 15:40:29,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:29,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203446035] [2019-11-28 15:40:29,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:29,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:29,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051578381] [2019-11-28 15:40:29,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:29,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,763 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-11-28 15:40:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:29,896 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-11-28 15:40:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:29,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:29,914 INFO L225 Difference]: With dead ends: 13256 [2019-11-28 15:40:29,914 INFO L226 Difference]: Without dead ends: 8966 [2019-11-28 15:40:29,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-11-28 15:40:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-11-28 15:40:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-11-28 15:40:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-11-28 15:40:30,139 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-11-28 15:40:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:30,139 INFO L462 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-11-28 15:40:30,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-11-28 15:40:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:30,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:30,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:30,149 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-11-28 15:40:30,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:30,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785721932] [2019-11-28 15:40:30,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:30,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785721932] [2019-11-28 15:40:30,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:30,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:30,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404304949] [2019-11-28 15:40:30,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:30,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:30,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:30,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:30,178 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-11-28 15:40:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:30,350 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-11-28 15:40:30,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:30,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:30,380 INFO L225 Difference]: With dead ends: 15368 [2019-11-28 15:40:30,380 INFO L226 Difference]: Without dead ends: 15366 [2019-11-28 15:40:30,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-11-28 15:40:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-11-28 15:40:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-11-28 15:40:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-11-28 15:40:30,782 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-11-28 15:40:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:30,782 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-11-28 15:40:30,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-11-28 15:40:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:30,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:30,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:30,808 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-11-28 15:40:30,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:30,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074264525] [2019-11-28 15:40:30,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:30,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074264525] [2019-11-28 15:40:30,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:30,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:30,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549919896] [2019-11-28 15:40:30,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:30,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:30,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:30,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:30,843 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-11-28 15:40:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:31,194 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-11-28 15:40:31,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:31,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:31,226 INFO L225 Difference]: With dead ends: 30472 [2019-11-28 15:40:31,226 INFO L226 Difference]: Without dead ends: 17414 [2019-11-28 15:40:31,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-11-28 15:40:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-11-28 15:40:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-11-28 15:40:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-11-28 15:40:31,590 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-11-28 15:40:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:31,591 INFO L462 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-11-28 15:40:31,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-11-28 15:40:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:31,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:31,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:31,608 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-11-28 15:40:31,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:31,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589219622] [2019-11-28 15:40:31,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:31,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589219622] [2019-11-28 15:40:31,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:31,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:31,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811638106] [2019-11-28 15:40:31,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:31,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:31,627 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-11-28 15:40:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:31,792 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-11-28 15:40:31,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:31,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:31,825 INFO L225 Difference]: With dead ends: 26120 [2019-11-28 15:40:31,825 INFO L226 Difference]: Without dead ends: 17670 [2019-11-28 15:40:31,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-11-28 15:40:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-11-28 15:40:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-11-28 15:40:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-11-28 15:40:32,154 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-11-28 15:40:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:32,155 INFO L462 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-11-28 15:40:32,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-11-28 15:40:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:32,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:32,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:32,173 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:32,173 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-11-28 15:40:32,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:32,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719052364] [2019-11-28 15:40:32,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:32,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719052364] [2019-11-28 15:40:32,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:32,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:32,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896486916] [2019-11-28 15:40:32,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:32,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:32,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:32,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:32,200 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-11-28 15:40:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:32,560 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-11-28 15:40:32,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:32,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:32,635 INFO L225 Difference]: With dead ends: 29704 [2019-11-28 15:40:32,635 INFO L226 Difference]: Without dead ends: 29702 [2019-11-28 15:40:32,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-11-28 15:40:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-11-28 15:40:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-11-28 15:40:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-11-28 15:40:33,136 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-11-28 15:40:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:33,137 INFO L462 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-11-28 15:40:33,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-11-28 15:40:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:33,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:33,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:33,168 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-11-28 15:40:33,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:33,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794455436] [2019-11-28 15:40:33,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:33,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794455436] [2019-11-28 15:40:33,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:33,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:33,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782205291] [2019-11-28 15:40:33,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:33,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:33,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:33,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:33,186 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-11-28 15:40:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:33,567 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-11-28 15:40:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:33,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:33,642 INFO L225 Difference]: With dead ends: 60424 [2019-11-28 15:40:33,642 INFO L226 Difference]: Without dead ends: 34310 [2019-11-28 15:40:33,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-11-28 15:40:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-11-28 15:40:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-11-28 15:40:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-11-28 15:40:34,503 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-11-28 15:40:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:34,503 INFO L462 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-11-28 15:40:34,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-11-28 15:40:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:34,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:34,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:34,530 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-11-28 15:40:34,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:34,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137946767] [2019-11-28 15:40:34,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:34,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137946767] [2019-11-28 15:40:34,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:34,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:34,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015608994] [2019-11-28 15:40:34,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:34,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:34,559 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-11-28 15:40:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:34,895 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-11-28 15:40:34,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:34,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:34,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:34,967 INFO L225 Difference]: With dead ends: 51464 [2019-11-28 15:40:34,968 INFO L226 Difference]: Without dead ends: 34822 [2019-11-28 15:40:34,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-11-28 15:40:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-11-28 15:40:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-11-28 15:40:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-11-28 15:40:35,978 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-11-28 15:40:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:35,978 INFO L462 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-11-28 15:40:35,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-11-28 15:40:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:36,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:36,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:36,007 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:36,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-11-28 15:40:36,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:36,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052903975] [2019-11-28 15:40:36,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:36,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052903975] [2019-11-28 15:40:36,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:36,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:36,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474396557] [2019-11-28 15:40:36,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:36,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:36,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:36,053 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-11-28 15:40:36,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:36,696 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-11-28 15:40:36,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:36,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:36,775 INFO L225 Difference]: With dead ends: 101384 [2019-11-28 15:40:36,775 INFO L226 Difference]: Without dead ends: 67590 [2019-11-28 15:40:36,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-11-28 15:40:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-11-28 15:40:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-28 15:40:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-11-28 15:40:38,481 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-11-28 15:40:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:38,482 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-11-28 15:40:38,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-11-28 15:40:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:38,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:38,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:38,515 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-11-28 15:40:38,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:38,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54866559] [2019-11-28 15:40:38,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:38,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54866559] [2019-11-28 15:40:38,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:38,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:38,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369221729] [2019-11-28 15:40:38,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:38,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:38,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:38,543 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-11-28 15:40:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:39,044 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-11-28 15:40:39,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:39,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:39,102 INFO L225 Difference]: With dead ends: 71688 [2019-11-28 15:40:39,102 INFO L226 Difference]: Without dead ends: 71686 [2019-11-28 15:40:39,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-11-28 15:40:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-11-28 15:40:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-28 15:40:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-11-28 15:40:40,488 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-11-28 15:40:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:40,488 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-11-28 15:40:40,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-11-28 15:40:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:40:40,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:40,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:40,522 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-11-28 15:40:40,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:40,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420667771] [2019-11-28 15:40:40,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:40,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420667771] [2019-11-28 15:40:40,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:40,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:40,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445906020] [2019-11-28 15:40:40,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:40,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:40,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:40,540 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-11-28 15:40:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,236 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-11-28 15:40:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 15:40:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,336 INFO L225 Difference]: With dead ends: 109574 [2019-11-28 15:40:41,337 INFO L226 Difference]: Without dead ends: 109572 [2019-11-28 15:40:41,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-11-28 15:40:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-11-28 15:40:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-11-28 15:40:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-11-28 15:40:43,286 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-11-28 15:40:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,287 INFO L462 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-11-28 15:40:43,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-11-28 15:40:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:40:43,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,330 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-11-28 15:40:43,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081731643] [2019-11-28 15:40:43,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:43,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081731643] [2019-11-28 15:40:43,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885451141] [2019-11-28 15:40:43,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,358 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-11-28 15:40:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:44,300 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-11-28 15:40:44,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:44,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 15:40:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:44,301 INFO L225 Difference]: With dead ends: 236548 [2019-11-28 15:40:44,302 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:44,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:44,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-28 15:40:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:44,375 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:44,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:44,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:44,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-28 15:40:44,414 INFO L246 CegarLoopResult]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,415 INFO L246 CegarLoopResult]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,415 INFO L246 CegarLoopResult]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,415 INFO L246 CegarLoopResult]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,415 INFO L246 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-28 15:40:44,415 INFO L246 CegarLoopResult]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L249 CegarLoopResult]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,416 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-28 15:40:44,417 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-28 15:40:44,417 INFO L246 CegarLoopResult]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,417 INFO L246 CegarLoopResult]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,417 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-28 15:40:44,417 INFO L249 CegarLoopResult]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-28 15:40:44,418 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-28 15:40:44,418 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:44,418 INFO L249 CegarLoopResult]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-11-28 15:40:44,419 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-28 15:40:44,419 INFO L246 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-28 15:40:44,419 INFO L242 CegarLoopResult]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-28 15:40:44,420 INFO L246 CegarLoopResult]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,420 INFO L246 CegarLoopResult]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,420 INFO L246 CegarLoopResult]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,420 INFO L246 CegarLoopResult]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,420 INFO L246 CegarLoopResult]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,420 INFO L246 CegarLoopResult]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,421 INFO L246 CegarLoopResult]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,421 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-28 15:40:44,421 INFO L246 CegarLoopResult]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-28 15:40:44,421 INFO L246 CegarLoopResult]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-11-28 15:40:44,421 INFO L246 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-28 15:40:44,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:44 BoogieIcfgContainer [2019-11-28 15:40:44,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:44,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:44,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:44,434 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:44,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:25" (3/4) ... [2019-11-28 15:40:44,438 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:44,454 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:44,454 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:44,563 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:44,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:44,565 INFO L168 Benchmark]: Toolchain (without parser) took 19945.76 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 961.7 MB in the beginning and 646.4 MB in the end (delta: 315.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-28 15:40:44,566 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:44,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:44,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:44,567 INFO L168 Benchmark]: Boogie Preprocessor took 24.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:44,568 INFO L168 Benchmark]: RCFGBuilder took 430.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:44,568 INFO L168 Benchmark]: TraceAbstraction took 18897.13 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 675.1 MB in the end (delta: 428.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-28 15:40:44,568 INFO L168 Benchmark]: Witness Printer took 129.53 ms. Allocated memory is still 2.5 GB. Free memory was 675.1 MB in the beginning and 646.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:44,571 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 430.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18897.13 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 675.1 MB in the end (delta: 428.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 129.53 ms. Allocated memory is still 2.5 GB. Free memory was 675.1 MB in the beginning and 646.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 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: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 18.7s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 38061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...