./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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_7.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 ccd6d122756047ddb1225c106ac06a6748e14c22 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:36:11,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:36:11,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:36:11,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:36:11,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:36:11,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:36:11,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:36:11,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:36:11,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:36:11,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:36:11,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:36:11,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:36:11,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:36:11,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:36:11,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:36:11,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:36:11,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:36:11,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:36:11,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:36:11,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:36:11,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:36:11,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:36:11,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:36:11,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:36:11,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:36:11,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:36:11,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:36:11,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:36:11,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:36:11,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:36:11,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:36:11,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:36:11,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:36:11,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:36:11,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:36:11,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:36:11,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:36:11,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:36:11,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:36:11,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:36:11,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:36:11,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:36:11,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:36:11,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:36:11,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:36:11,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:36:11,551 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:36:11,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:36:11,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:36:11,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:36:11,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:36:11,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:36:11,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:36:11,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:36:11,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:36:11,553 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:36:11,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:36:11,554 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:36:11,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:36:11,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:36:11,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:36:11,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:36:11,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:36:11,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:36:11,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:36:11,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:36:11,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:36:11,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:36:11,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:36:11,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:36:11,558 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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-11-27 22:36:11,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:36:11,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:36:11,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:36:11,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:36:11,942 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:36:11,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2019-11-27 22:36:12,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f28be52a/c100d00054e44e6c89361c02b3528f87/FLAGf49b3c5c5 [2019-11-27 22:36:12,526 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:36:12,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2019-11-27 22:36:12,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f28be52a/c100d00054e44e6c89361c02b3528f87/FLAGf49b3c5c5 [2019-11-27 22:36:12,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f28be52a/c100d00054e44e6c89361c02b3528f87 [2019-11-27 22:36:12,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:36:12,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:36:12,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:12,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:36:12,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:36:12,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:12" (1/1) ... [2019-11-27 22:36:12,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e7655c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:12, skipping insertion in model container [2019-11-27 22:36:12,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:12" (1/1) ... [2019-11-27 22:36:12,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:36:12,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:36:13,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:13,129 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:36:13,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:13,177 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:36:13,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13 WrapperNode [2019-11-27 22:36:13,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:13,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:13,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:36:13,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:36:13,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:13,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:36:13,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:36:13,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:36:13,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (1/1) ... [2019-11-27 22:36:13,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:36:13,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:36:13,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:36:13,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:36:13,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (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-27 22:36:13,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:36:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:36:13,693 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:36:13,693 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 22:36:13,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13 BoogieIcfgContainer [2019-11-27 22:36:13,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:36:13,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:36:13,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:36:13,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:36:13,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:36:12" (1/3) ... [2019-11-27 22:36:13,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9fe4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:13, skipping insertion in model container [2019-11-27 22:36:13,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:13" (2/3) ... [2019-11-27 22:36:13,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9fe4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:13, skipping insertion in model container [2019-11-27 22:36:13,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13" (3/3) ... [2019-11-27 22:36:13,705 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-11-27 22:36:13,713 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:36:13,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:36:13,728 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:36:13,752 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:36:13,752 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:36:13,752 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:36:13,752 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:36:13,752 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:36:13,752 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:36:13,753 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:36:13,753 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:36:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-27 22:36:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:13,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:13,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:13,774 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1589939160, now seen corresponding path program 1 times [2019-11-27 22:36:13,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:13,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208869806] [2019-11-27 22:36:13,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:13,992 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-27 22:36:13,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208869806] [2019-11-27 22:36:13,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:13,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:13,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391522826] [2019-11-27 22:36:14,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,013 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-11-27 22:36:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,073 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2019-11-27 22:36:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,085 INFO L225 Difference]: With dead ends: 64 [2019-11-27 22:36:14,085 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 22:36:14,088 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-27 22:36:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 22:36:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-11-27 22:36:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-27 22:36:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2019-11-27 22:36:14,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 13 [2019-11-27 22:36:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,128 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2019-11-27 22:36:14,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2019-11-27 22:36:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:14,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,129 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1982966170, now seen corresponding path program 1 times [2019-11-27 22:36:14,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944520913] [2019-11-27 22:36:14,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,196 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-27 22:36:14,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944520913] [2019-11-27 22:36:14,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464251651] [2019-11-27 22:36:14,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,201 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2019-11-27 22:36:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,232 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2019-11-27 22:36:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,235 INFO L225 Difference]: With dead ends: 83 [2019-11-27 22:36:14,236 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 22:36:14,237 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-27 22:36:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 22:36:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-27 22:36:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-27 22:36:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-11-27 22:36:14,249 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 13 [2019-11-27 22:36:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,250 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-11-27 22:36:14,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-11-27 22:36:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,251 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2043259385, now seen corresponding path program 1 times [2019-11-27 22:36:14,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531181892] [2019-11-27 22:36:14,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,307 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-27 22:36:14,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531181892] [2019-11-27 22:36:14,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633603855] [2019-11-27 22:36:14,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,311 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-11-27 22:36:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,340 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2019-11-27 22:36:14,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,343 INFO L225 Difference]: With dead ends: 77 [2019-11-27 22:36:14,343 INFO L226 Difference]: Without dead ends: 53 [2019-11-27 22:36:14,344 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-27 22:36:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-27 22:36:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-11-27 22:36:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-27 22:36:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2019-11-27 22:36:14,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 14 [2019-11-27 22:36:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,353 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2019-11-27 22:36:14,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2019-11-27 22:36:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,355 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1342194807, now seen corresponding path program 1 times [2019-11-27 22:36:14,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313846317] [2019-11-27 22:36:14,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,394 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-27 22:36:14,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313846317] [2019-11-27 22:36:14,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404696279] [2019-11-27 22:36:14,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,397 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2019-11-27 22:36:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,421 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2019-11-27 22:36:14,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,424 INFO L225 Difference]: With dead ends: 96 [2019-11-27 22:36:14,424 INFO L226 Difference]: Without dead ends: 94 [2019-11-27 22:36:14,425 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-27 22:36:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-27 22:36:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-11-27 22:36:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-27 22:36:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-11-27 22:36:14,443 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 14 [2019-11-27 22:36:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,444 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-11-27 22:36:14,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-11-27 22:36:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,450 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1735221817, now seen corresponding path program 1 times [2019-11-27 22:36:14,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636717993] [2019-11-27 22:36:14,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,502 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-27 22:36:14,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636717993] [2019-11-27 22:36:14,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127375963] [2019-11-27 22:36:14,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,505 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 3 states. [2019-11-27 22:36:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,533 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2019-11-27 22:36:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,535 INFO L225 Difference]: With dead ends: 160 [2019-11-27 22:36:14,535 INFO L226 Difference]: Without dead ends: 96 [2019-11-27 22:36:14,536 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-27 22:36:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-27 22:36:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-27 22:36:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-27 22:36:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 158 transitions. [2019-11-27 22:36:14,554 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 158 transitions. Word has length 14 [2019-11-27 22:36:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,555 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 158 transitions. [2019-11-27 22:36:14,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 158 transitions. [2019-11-27 22:36:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,558 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848603, now seen corresponding path program 1 times [2019-11-27 22:36:14,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893706708] [2019-11-27 22:36:14,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,588 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-27 22:36:14,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893706708] [2019-11-27 22:36:14,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422149584] [2019-11-27 22:36:14,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,591 INFO L87 Difference]: Start difference. First operand 94 states and 158 transitions. Second operand 3 states. [2019-11-27 22:36:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,614 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2019-11-27 22:36:14,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,616 INFO L225 Difference]: With dead ends: 143 [2019-11-27 22:36:14,616 INFO L226 Difference]: Without dead ends: 98 [2019-11-27 22:36:14,617 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-27 22:36:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-27 22:36:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-27 22:36:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-27 22:36:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 158 transitions. [2019-11-27 22:36:14,630 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 158 transitions. Word has length 15 [2019-11-27 22:36:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,630 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 158 transitions. [2019-11-27 22:36:14,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 158 transitions. [2019-11-27 22:36:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,634 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2042913181, now seen corresponding path program 1 times [2019-11-27 22:36:14,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986793756] [2019-11-27 22:36:14,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,693 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-27 22:36:14,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986793756] [2019-11-27 22:36:14,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028948066] [2019-11-27 22:36:14,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,695 INFO L87 Difference]: Start difference. First operand 96 states and 158 transitions. Second operand 3 states. [2019-11-27 22:36:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,721 INFO L93 Difference]: Finished difference Result 272 states and 448 transitions. [2019-11-27 22:36:14,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,724 INFO L225 Difference]: With dead ends: 272 [2019-11-27 22:36:14,724 INFO L226 Difference]: Without dead ends: 182 [2019-11-27 22:36:14,725 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-27 22:36:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-27 22:36:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-27 22:36:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-27 22:36:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-11-27 22:36:14,740 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 15 [2019-11-27 22:36:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,740 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-11-27 22:36:14,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-11-27 22:36:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1859027105, now seen corresponding path program 1 times [2019-11-27 22:36:14,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298251346] [2019-11-27 22:36:14,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,782 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-27 22:36:14,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298251346] [2019-11-27 22:36:14,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653036714] [2019-11-27 22:36:14,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,785 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 3 states. [2019-11-27 22:36:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,807 INFO L93 Difference]: Finished difference Result 224 states and 364 transitions. [2019-11-27 22:36:14,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,809 INFO L225 Difference]: With dead ends: 224 [2019-11-27 22:36:14,810 INFO L226 Difference]: Without dead ends: 222 [2019-11-27 22:36:14,810 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-27 22:36:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-27 22:36:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2019-11-27 22:36:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-27 22:36:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2019-11-27 22:36:14,836 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 15 [2019-11-27 22:36:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,836 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2019-11-27 22:36:14,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2019-11-27 22:36:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:14,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,842 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1093985828, now seen corresponding path program 1 times [2019-11-27 22:36:14,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476448800] [2019-11-27 22:36:14,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,907 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-27 22:36:14,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476448800] [2019-11-27 22:36:14,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319612556] [2019-11-27 22:36:14,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,912 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand 3 states. [2019-11-27 22:36:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,950 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2019-11-27 22:36:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,953 INFO L225 Difference]: With dead ends: 324 [2019-11-27 22:36:14,953 INFO L226 Difference]: Without dead ends: 322 [2019-11-27 22:36:14,954 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-27 22:36:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-27 22:36:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2019-11-27 22:36:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-27 22:36:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2019-11-27 22:36:14,968 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 16 [2019-11-27 22:36:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,968 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2019-11-27 22:36:14,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2019-11-27 22:36:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:14,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,971 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1487012838, now seen corresponding path program 1 times [2019-11-27 22:36:14,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627300014] [2019-11-27 22:36:14,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,994 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-27 22:36:14,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627300014] [2019-11-27 22:36:14,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982409313] [2019-11-27 22:36:14,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,997 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 3 states. [2019-11-27 22:36:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,033 INFO L93 Difference]: Finished difference Result 596 states and 928 transitions. [2019-11-27 22:36:15,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,037 INFO L225 Difference]: With dead ends: 596 [2019-11-27 22:36:15,037 INFO L226 Difference]: Without dead ends: 346 [2019-11-27 22:36:15,039 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-27 22:36:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-27 22:36:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-11-27 22:36:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-27 22:36:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2019-11-27 22:36:15,053 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 16 [2019-11-27 22:36:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,054 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2019-11-27 22:36:15,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2019-11-27 22:36:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:15,056 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,056 INFO L82 PathProgramCache]: Analyzing trace with hash 446393042, now seen corresponding path program 1 times [2019-11-27 22:36:15,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975724169] [2019-11-27 22:36:15,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,085 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-27 22:36:15,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975724169] [2019-11-27 22:36:15,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380435579] [2019-11-27 22:36:15,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,088 INFO L87 Difference]: Start difference. First operand 344 states and 522 transitions. Second operand 3 states. [2019-11-27 22:36:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,113 INFO L93 Difference]: Finished difference Result 524 states and 792 transitions. [2019-11-27 22:36:15,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,115 INFO L225 Difference]: With dead ends: 524 [2019-11-27 22:36:15,116 INFO L226 Difference]: Without dead ends: 358 [2019-11-27 22:36:15,116 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-27 22:36:15,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-27 22:36:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-27 22:36:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-27 22:36:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 530 transitions. [2019-11-27 22:36:15,130 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 530 transitions. Word has length 17 [2019-11-27 22:36:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,130 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 530 transitions. [2019-11-27 22:36:15,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 530 transitions. [2019-11-27 22:36:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:15,132 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1147457620, now seen corresponding path program 1 times [2019-11-27 22:36:15,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511974567] [2019-11-27 22:36:15,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,178 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-27 22:36:15,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511974567] [2019-11-27 22:36:15,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024234792] [2019-11-27 22:36:15,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,181 INFO L87 Difference]: Start difference. First operand 356 states and 530 transitions. Second operand 3 states. [2019-11-27 22:36:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,216 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2019-11-27 22:36:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,220 INFO L225 Difference]: With dead ends: 616 [2019-11-27 22:36:15,221 INFO L226 Difference]: Without dead ends: 614 [2019-11-27 22:36:15,221 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-27 22:36:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-27 22:36:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 516. [2019-11-27 22:36:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-27 22:36:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2019-11-27 22:36:15,243 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 17 [2019-11-27 22:36:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,244 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2019-11-27 22:36:15,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2019-11-27 22:36:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:15,246 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 754430610, now seen corresponding path program 1 times [2019-11-27 22:36:15,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071075573] [2019-11-27 22:36:15,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,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-27 22:36:15,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071075573] [2019-11-27 22:36:15,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217016356] [2019-11-27 22:36:15,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,282 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand 3 states. [2019-11-27 22:36:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,313 INFO L93 Difference]: Finished difference Result 1176 states and 1692 transitions. [2019-11-27 22:36:15,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,318 INFO L225 Difference]: With dead ends: 1176 [2019-11-27 22:36:15,318 INFO L226 Difference]: Without dead ends: 678 [2019-11-27 22:36:15,321 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-27 22:36:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-11-27 22:36:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2019-11-27 22:36:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-27 22:36:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 946 transitions. [2019-11-27 22:36:15,349 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 946 transitions. Word has length 17 [2019-11-27 22:36:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,350 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 946 transitions. [2019-11-27 22:36:15,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 946 transitions. [2019-11-27 22:36:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:15,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,352 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-27 22:36:15,353 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1211663535, now seen corresponding path program 1 times [2019-11-27 22:36:15,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449059621] [2019-11-27 22:36:15,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,391 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-27 22:36:15,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449059621] [2019-11-27 22:36:15,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133617486] [2019-11-27 22:36:15,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,395 INFO L87 Difference]: Start difference. First operand 676 states and 946 transitions. Second operand 3 states. [2019-11-27 22:36:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,426 INFO L93 Difference]: Finished difference Result 1016 states and 1412 transitions. [2019-11-27 22:36:15,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,431 INFO L225 Difference]: With dead ends: 1016 [2019-11-27 22:36:15,431 INFO L226 Difference]: Without dead ends: 694 [2019-11-27 22:36:15,433 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-27 22:36:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-11-27 22:36:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-11-27 22:36:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-27 22:36:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 946 transitions. [2019-11-27 22:36:15,462 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 946 transitions. Word has length 18 [2019-11-27 22:36:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,464 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 946 transitions. [2019-11-27 22:36:15,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 946 transitions. [2019-11-27 22:36:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:15,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,466 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-27 22:36:15,466 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1912728113, now seen corresponding path program 1 times [2019-11-27 22:36:15,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632233211] [2019-11-27 22:36:15,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,503 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-27 22:36:15,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632233211] [2019-11-27 22:36:15,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645916408] [2019-11-27 22:36:15,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,506 INFO L87 Difference]: Start difference. First operand 692 states and 946 transitions. Second operand 3 states. [2019-11-27 22:36:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,540 INFO L93 Difference]: Finished difference Result 1160 states and 1588 transitions. [2019-11-27 22:36:15,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,547 INFO L225 Difference]: With dead ends: 1160 [2019-11-27 22:36:15,547 INFO L226 Difference]: Without dead ends: 1158 [2019-11-27 22:36:15,549 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-27 22:36:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-27 22:36:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1028. [2019-11-27 22:36:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-11-27 22:36:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1362 transitions. [2019-11-27 22:36:15,585 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1362 transitions. Word has length 18 [2019-11-27 22:36:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,585 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1362 transitions. [2019-11-27 22:36:15,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1362 transitions. [2019-11-27 22:36:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:15,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,589 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-27 22:36:15,589 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1519701103, now seen corresponding path program 1 times [2019-11-27 22:36:15,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399780443] [2019-11-27 22:36:15,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,620 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-27 22:36:15,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399780443] [2019-11-27 22:36:15,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043530495] [2019-11-27 22:36:15,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,623 INFO L87 Difference]: Start difference. First operand 1028 states and 1362 transitions. Second operand 3 states. [2019-11-27 22:36:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,667 INFO L93 Difference]: Finished difference Result 2312 states and 3028 transitions. [2019-11-27 22:36:15,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,676 INFO L225 Difference]: With dead ends: 2312 [2019-11-27 22:36:15,676 INFO L226 Difference]: Without dead ends: 1318 [2019-11-27 22:36:15,678 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-27 22:36:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-11-27 22:36:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2019-11-27 22:36:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-11-27 22:36:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1666 transitions. [2019-11-27 22:36:15,728 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1666 transitions. Word has length 18 [2019-11-27 22:36:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,729 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1666 transitions. [2019-11-27 22:36:15,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1666 transitions. [2019-11-27 22:36:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:15,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,732 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-27 22:36:15,732 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash -834754617, now seen corresponding path program 1 times [2019-11-27 22:36:15,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828025733] [2019-11-27 22:36:15,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,749 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-27 22:36:15,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828025733] [2019-11-27 22:36:15,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075451258] [2019-11-27 22:36:15,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,752 INFO L87 Difference]: Start difference. First operand 1316 states and 1666 transitions. Second operand 3 states. [2019-11-27 22:36:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,791 INFO L93 Difference]: Finished difference Result 1976 states and 2484 transitions. [2019-11-27 22:36:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,798 INFO L225 Difference]: With dead ends: 1976 [2019-11-27 22:36:15,799 INFO L226 Difference]: Without dead ends: 1350 [2019-11-27 22:36:15,800 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-27 22:36:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-27 22:36:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-11-27 22:36:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-11-27 22:36:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1666 transitions. [2019-11-27 22:36:15,870 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1666 transitions. Word has length 19 [2019-11-27 22:36:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,871 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 1666 transitions. [2019-11-27 22:36:15,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1666 transitions. [2019-11-27 22:36:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:15,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,876 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-27 22:36:15,876 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash -133690039, now seen corresponding path program 1 times [2019-11-27 22:36:15,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060796216] [2019-11-27 22:36:15,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,899 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-27 22:36:15,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060796216] [2019-11-27 22:36:15,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983767893] [2019-11-27 22:36:15,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,902 INFO L87 Difference]: Start difference. First operand 1348 states and 1666 transitions. Second operand 3 states. [2019-11-27 22:36:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,968 INFO L93 Difference]: Finished difference Result 2182 states and 2659 transitions. [2019-11-27 22:36:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,983 INFO L225 Difference]: With dead ends: 2182 [2019-11-27 22:36:15,983 INFO L226 Difference]: Without dead ends: 2180 [2019-11-27 22:36:15,985 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-27 22:36:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-11-27 22:36:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2052. [2019-11-27 22:36:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-27 22:36:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2466 transitions. [2019-11-27 22:36:16,083 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2466 transitions. Word has length 19 [2019-11-27 22:36:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:16,084 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 2466 transitions. [2019-11-27 22:36:16,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2466 transitions. [2019-11-27 22:36:16,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:16,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:16,091 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-27 22:36:16,091 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:16,092 INFO L82 PathProgramCache]: Analyzing trace with hash -526717049, now seen corresponding path program 1 times [2019-11-27 22:36:16,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:16,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710818929] [2019-11-27 22:36:16,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:16,115 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-27 22:36:16,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710818929] [2019-11-27 22:36:16,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:16,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:16,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720280662] [2019-11-27 22:36:16,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:16,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:16,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:16,118 INFO L87 Difference]: Start difference. First operand 2052 states and 2466 transitions. Second operand 3 states. [2019-11-27 22:36:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:16,218 INFO L93 Difference]: Finished difference Result 4548 states and 5346 transitions. [2019-11-27 22:36:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:16,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:16,220 INFO L225 Difference]: With dead ends: 4548 [2019-11-27 22:36:16,220 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:16,228 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-27 22:36:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:16,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-27 22:36:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:16,230 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:16,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:16,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:16,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:16,260 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-27 22:36:16,260 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:16,281 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:16,281 INFO L246 CegarLoopResult]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,281 INFO L249 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-11-27 22:36:16,281 INFO L249 CegarLoopResult]: At program point L120(lines 4 121) the Hoare annotation is: true [2019-11-27 22:36:16,281 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-27 22:36:16,282 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-27 22:36:16,282 INFO L242 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-11-27 22:36:16,282 INFO L246 CegarLoopResult]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,282 INFO L246 CegarLoopResult]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,282 INFO L246 CegarLoopResult]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,282 INFO L246 CegarLoopResult]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,282 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-27 22:36:16,282 INFO L246 CegarLoopResult]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,283 INFO L246 CegarLoopResult]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,284 INFO L246 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-27 22:36:16,284 INFO L246 CegarLoopResult]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,284 INFO L249 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-11-27 22:36:16,284 INFO L246 CegarLoopResult]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-27 22:36:16,284 INFO L246 CegarLoopResult]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,284 INFO L246 CegarLoopResult]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-11-27 22:36:16,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:16 BoogieIcfgContainer [2019-11-27 22:36:16,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:16,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:16,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:16,300 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:16,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13" (3/4) ... [2019-11-27 22:36:16,306 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:16,323 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:36:16,323 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:16,394 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:16,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:16,397 INFO L168 Benchmark]: Toolchain (without parser) took 3530.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -243.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:36:16,397 INFO L168 Benchmark]: CDTParser took 0.61 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-27 22:36:16,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.52 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:16,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:16,399 INFO L168 Benchmark]: Boogie Preprocessor took 22.31 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:16,400 INFO L168 Benchmark]: RCFGBuilder took 392.10 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:16,400 INFO L168 Benchmark]: TraceAbstraction took 2602.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.9 MB). Peak memory consumption was 294.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:16,401 INFO L168 Benchmark]: Witness Printer took 94.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:16,404 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.61 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 311.52 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.31 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.10 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2602.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.9 MB). Peak memory consumption was 294.7 MB. Max. memory is 11.5 GB. * Witness Printer took 94.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1109 SDtfs, 543 SDslu, 710 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2052occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...