./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 5107685577f81a5867811396b2c0a05eb5630c95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:15,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:36:15,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:36:15,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:36:15,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:36:15,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:36:15,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:36:15,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:36:15,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:36:15,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:36:15,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:36:15,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:36:15,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:36:15,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:36:15,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:36:15,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:36:15,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:36:15,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:36:15,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:36:15,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:36:15,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:36:15,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:36:15,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:36:15,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:36:15,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:36:15,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:36:15,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:36:15,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:36:15,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:36:15,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:36:15,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:36:15,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:36:15,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:36:15,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:36:15,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:36:15,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:36:15,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:36:15,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:36:15,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:36:15,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:36:15,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:36:15,496 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:15,511 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:36:15,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:36:15,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:36:15,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:36:15,514 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:36:15,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:36:15,514 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:36:15,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:36:15,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:36:15,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:36:15,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:36:15,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:36:15,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:36:15,516 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:36:15,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:36:15,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:36:15,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:36:15,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:36:15,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:36:15,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:36:15,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:36:15,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:36:15,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:36:15,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:36:15,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:36:15,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:36:15,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:36:15,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:36:15,521 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-11-27 22:36:15,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:36:15,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:36:15,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:36:15,837 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:36:15,837 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:36:15,838 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2019-11-27 22:36:15,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0052899f5/1e38ef324ae144988cfc1e660a4846a3/FLAG42593ecd5 [2019-11-27 22:36:16,411 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:36:16,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2019-11-27 22:36:16,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0052899f5/1e38ef324ae144988cfc1e660a4846a3/FLAG42593ecd5 [2019-11-27 22:36:16,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0052899f5/1e38ef324ae144988cfc1e660a4846a3 [2019-11-27 22:36:16,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:36:16,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:36:16,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:16,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:36:16,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:36:16,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:16" (1/1) ... [2019-11-27 22:36:16,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a4f9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:16, skipping insertion in model container [2019-11-27 22:36:16,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:16" (1/1) ... [2019-11-27 22:36:16,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:36:16,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:36:17,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:17,029 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:36:17,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:17,112 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:36:17,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:17 WrapperNode [2019-11-27 22:36:17,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:17,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:17,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:36:17,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:36:17,199 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:17" (1/1) ... [2019-11-27 22:36:17,206 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:17" (1/1) ... [2019-11-27 22:36:17,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:17,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:36:17,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:36:17,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:36:17,247 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:17" (1/1) ... [2019-11-27 22:36:17,248 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:17" (1/1) ... [2019-11-27 22:36:17,259 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:17" (1/1) ... [2019-11-27 22:36:17,260 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:17" (1/1) ... [2019-11-27 22:36:17,269 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:17" (1/1) ... [2019-11-27 22:36:17,285 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:17" (1/1) ... [2019-11-27 22:36:17,287 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:17" (1/1) ... [2019-11-27 22:36:17,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:36:17,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:36:17,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:36:17,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:36:17,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:17" (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:17,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:36:17,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:36:17,654 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:36:17,654 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 22:36:17,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:17 BoogieIcfgContainer [2019-11-27 22:36:17,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:36:17,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:36:17,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:36:17,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:36:17,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:36:16" (1/3) ... [2019-11-27 22:36:17,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581f88be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:17, skipping insertion in model container [2019-11-27 22:36:17,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:17" (2/3) ... [2019-11-27 22:36:17,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581f88be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:17, skipping insertion in model container [2019-11-27 22:36:17,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:17" (3/3) ... [2019-11-27 22:36:17,685 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-11-27 22:36:17,696 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:36:17,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:36:17,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:36:17,765 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:36:17,766 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:36:17,766 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:36:17,766 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:36:17,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:36:17,767 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:36:17,767 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:36:17,767 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:36:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-27 22:36:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:17,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:17,789 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:17,789 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1076851140, now seen corresponding path program 1 times [2019-11-27 22:36:17,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:17,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726473702] [2019-11-27 22:36:17,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:17,998 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:18,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726473702] [2019-11-27 22:36:18,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446431332] [2019-11-27 22:36:18,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,025 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-11-27 22:36:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,087 INFO L93 Difference]: Finished difference Result 76 states and 132 transitions. [2019-11-27 22:36:18,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,101 INFO L225 Difference]: With dead ends: 76 [2019-11-27 22:36:18,101 INFO L226 Difference]: Without dead ends: 62 [2019-11-27 22:36:18,104 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:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-27 22:36:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-27 22:36:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:36:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2019-11-27 22:36:18,146 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2019-11-27 22:36:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,146 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2019-11-27 22:36:18,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2019-11-27 22:36:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:18,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,148 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:18,148 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1335016578, now seen corresponding path program 1 times [2019-11-27 22:36:18,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174572151] [2019-11-27 22:36:18,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,204 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:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174572151] [2019-11-27 22:36:18,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422149584] [2019-11-27 22:36:18,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,212 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand 3 states. [2019-11-27 22:36:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,260 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2019-11-27 22:36:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,262 INFO L225 Difference]: With dead ends: 103 [2019-11-27 22:36:18,262 INFO L226 Difference]: Without dead ends: 62 [2019-11-27 22:36:18,263 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:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-27 22:36:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-27 22:36:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-27 22:36:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2019-11-27 22:36:18,272 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2019-11-27 22:36:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,273 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2019-11-27 22:36:18,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2019-11-27 22:36:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:18,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,274 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:18,274 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash -977139357, now seen corresponding path program 1 times [2019-11-27 22:36:18,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413442004] [2019-11-27 22:36:18,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,323 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:18,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413442004] [2019-11-27 22:36:18,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135390160] [2019-11-27 22:36:18,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,325 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 3 states. [2019-11-27 22:36:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,355 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2019-11-27 22:36:18,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,357 INFO L225 Difference]: With dead ends: 95 [2019-11-27 22:36:18,358 INFO L226 Difference]: Without dead ends: 65 [2019-11-27 22:36:18,359 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:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-27 22:36:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-27 22:36:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-27 22:36:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2019-11-27 22:36:18,371 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2019-11-27 22:36:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,371 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2019-11-27 22:36:18,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2019-11-27 22:36:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:18,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,373 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:18,373 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1563945371, now seen corresponding path program 1 times [2019-11-27 22:36:18,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149910013] [2019-11-27 22:36:18,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:18,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149910013] [2019-11-27 22:36:18,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753192523] [2019-11-27 22:36:18,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,441 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand 3 states. [2019-11-27 22:36:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,460 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-11-27 22:36:18,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,462 INFO L225 Difference]: With dead ends: 120 [2019-11-27 22:36:18,462 INFO L226 Difference]: Without dead ends: 118 [2019-11-27 22:36:18,463 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:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-27 22:36:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2019-11-27 22:36:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-27 22:36:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2019-11-27 22:36:18,473 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2019-11-27 22:36:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,473 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2019-11-27 22:36:18,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2019-11-27 22:36:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:18,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,475 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:18,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1305779933, now seen corresponding path program 1 times [2019-11-27 22:36:18,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435454711] [2019-11-27 22:36:18,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,522 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:18,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435454711] [2019-11-27 22:36:18,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747882793] [2019-11-27 22:36:18,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,527 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand 3 states. [2019-11-27 22:36:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,548 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2019-11-27 22:36:18,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,551 INFO L225 Difference]: With dead ends: 200 [2019-11-27 22:36:18,551 INFO L226 Difference]: Without dead ends: 120 [2019-11-27 22:36:18,552 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:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-27 22:36:18,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-11-27 22:36:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-27 22:36:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2019-11-27 22:36:18,563 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2019-11-27 22:36:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,564 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2019-11-27 22:36:18,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2019-11-27 22:36:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:18,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,565 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:18,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1237452233, now seen corresponding path program 1 times [2019-11-27 22:36:18,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003930375] [2019-11-27 22:36:18,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,628 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:18,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003930375] [2019-11-27 22:36:18,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931766799] [2019-11-27 22:36:18,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,631 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand 3 states. [2019-11-27 22:36:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,654 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2019-11-27 22:36:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,657 INFO L225 Difference]: With dead ends: 179 [2019-11-27 22:36:18,657 INFO L226 Difference]: Without dead ends: 122 [2019-11-27 22:36:18,658 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:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-27 22:36:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-27 22:36:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-27 22:36:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2019-11-27 22:36:18,680 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2019-11-27 22:36:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,680 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2019-11-27 22:36:18,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2019-11-27 22:36:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:18,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,683 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:18,683 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1824258247, now seen corresponding path program 1 times [2019-11-27 22:36:18,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928373435] [2019-11-27 22:36:18,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,747 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:18,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928373435] [2019-11-27 22:36:18,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491545353] [2019-11-27 22:36:18,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,756 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand 3 states. [2019-11-27 22:36:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,778 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2019-11-27 22:36:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,781 INFO L225 Difference]: With dead ends: 344 [2019-11-27 22:36:18,781 INFO L226 Difference]: Without dead ends: 230 [2019-11-27 22:36:18,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-27 22:36:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2019-11-27 22:36:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-27 22:36:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2019-11-27 22:36:18,799 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2019-11-27 22:36:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,799 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2019-11-27 22:36:18,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2019-11-27 22:36:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:18,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,801 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:18,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2082423685, now seen corresponding path program 1 times [2019-11-27 22:36:18,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170422067] [2019-11-27 22:36:18,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,837 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:18,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170422067] [2019-11-27 22:36:18,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388470509] [2019-11-27 22:36:18,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,840 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand 3 states. [2019-11-27 22:36:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,865 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2019-11-27 22:36:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,869 INFO L225 Difference]: With dead ends: 288 [2019-11-27 22:36:18,869 INFO L226 Difference]: Without dead ends: 286 [2019-11-27 22:36:18,870 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:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-27 22:36:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2019-11-27 22:36:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-27 22:36:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2019-11-27 22:36:18,895 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2019-11-27 22:36:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,895 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2019-11-27 22:36:18,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2019-11-27 22:36:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:18,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,902 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:18,903 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash -717216456, now seen corresponding path program 1 times [2019-11-27 22:36:18,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:18,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420715993] [2019-11-27 22:36:18,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:18,941 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:18,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420715993] [2019-11-27 22:36:18,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:18,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:18,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211439815] [2019-11-27 22:36:18,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:18,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:18,944 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand 3 states. [2019-11-27 22:36:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:18,966 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-11-27 22:36:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:18,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:18,969 INFO L225 Difference]: With dead ends: 420 [2019-11-27 22:36:18,970 INFO L226 Difference]: Without dead ends: 418 [2019-11-27 22:36:18,970 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:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-27 22:36:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2019-11-27 22:36:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-27 22:36:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2019-11-27 22:36:18,996 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2019-11-27 22:36:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:18,997 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2019-11-27 22:36:18,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2019-11-27 22:36:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:36:18,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:18,999 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:18,999 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash -459051018, now seen corresponding path program 1 times [2019-11-27 22:36:19,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966724312] [2019-11-27 22:36:19,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,059 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:19,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966724312] [2019-11-27 22:36:19,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279120937] [2019-11-27 22:36:19,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,066 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand 3 states. [2019-11-27 22:36:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,104 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2019-11-27 22:36:19,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 22:36:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,113 INFO L225 Difference]: With dead ends: 756 [2019-11-27 22:36:19,113 INFO L226 Difference]: Without dead ends: 442 [2019-11-27 22:36:19,115 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:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-27 22:36:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-11-27 22:36:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-27 22:36:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2019-11-27 22:36:19,145 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2019-11-27 22:36:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,148 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2019-11-27 22:36:19,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2019-11-27 22:36:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:19,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,150 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:19,150 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash -758658962, now seen corresponding path program 1 times [2019-11-27 22:36:19,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031925895] [2019-11-27 22:36:19,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,201 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:19,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031925895] [2019-11-27 22:36:19,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870587511] [2019-11-27 22:36:19,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,203 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand 3 states. [2019-11-27 22:36:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,233 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2019-11-27 22:36:19,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,237 INFO L225 Difference]: With dead ends: 668 [2019-11-27 22:36:19,237 INFO L226 Difference]: Without dead ends: 454 [2019-11-27 22:36:19,239 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:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-27 22:36:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2019-11-27 22:36:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-27 22:36:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2019-11-27 22:36:19,258 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2019-11-27 22:36:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,258 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2019-11-27 22:36:19,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2019-11-27 22:36:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:19,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,260 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:19,260 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1345464976, now seen corresponding path program 1 times [2019-11-27 22:36:19,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881333950] [2019-11-27 22:36:19,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,300 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:19,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881333950] [2019-11-27 22:36:19,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221457267] [2019-11-27 22:36:19,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,302 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand 3 states. [2019-11-27 22:36:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,330 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2019-11-27 22:36:19,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,335 INFO L225 Difference]: With dead ends: 808 [2019-11-27 22:36:19,336 INFO L226 Difference]: Without dead ends: 806 [2019-11-27 22:36:19,336 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:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-11-27 22:36:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2019-11-27 22:36:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-27 22:36:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2019-11-27 22:36:19,359 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2019-11-27 22:36:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,359 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2019-11-27 22:36:19,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2019-11-27 22:36:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 22:36:19,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,362 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:19,362 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1087299538, now seen corresponding path program 1 times [2019-11-27 22:36:19,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381300623] [2019-11-27 22:36:19,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,385 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:19,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381300623] [2019-11-27 22:36:19,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607640973] [2019-11-27 22:36:19,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,388 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand 3 states. [2019-11-27 22:36:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,416 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2019-11-27 22:36:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-27 22:36:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,422 INFO L225 Difference]: With dead ends: 1496 [2019-11-27 22:36:19,422 INFO L226 Difference]: Without dead ends: 870 [2019-11-27 22:36:19,423 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:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-11-27 22:36:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2019-11-27 22:36:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-11-27 22:36:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2019-11-27 22:36:19,453 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2019-11-27 22:36:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,453 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2019-11-27 22:36:19,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2019-11-27 22:36:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:36:19,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:19,456 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1240473739, now seen corresponding path program 1 times [2019-11-27 22:36:19,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992025257] [2019-11-27 22:36:19,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,478 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:19,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992025257] [2019-11-27 22:36:19,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973640751] [2019-11-27 22:36:19,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,481 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand 3 states. [2019-11-27 22:36:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,513 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2019-11-27 22:36:19,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:36:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,518 INFO L225 Difference]: With dead ends: 1304 [2019-11-27 22:36:19,518 INFO L226 Difference]: Without dead ends: 886 [2019-11-27 22:36:19,519 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:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-11-27 22:36:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2019-11-27 22:36:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-11-27 22:36:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2019-11-27 22:36:19,549 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2019-11-27 22:36:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,550 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2019-11-27 22:36:19,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2019-11-27 22:36:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:36:19,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:19,552 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 653667725, now seen corresponding path program 1 times [2019-11-27 22:36:19,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251896062] [2019-11-27 22:36:19,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,575 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:19,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251896062] [2019-11-27 22:36:19,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638869920] [2019-11-27 22:36:19,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,577 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand 3 states. [2019-11-27 22:36:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,612 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2019-11-27 22:36:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:36:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,620 INFO L225 Difference]: With dead ends: 1544 [2019-11-27 22:36:19,620 INFO L226 Difference]: Without dead ends: 1542 [2019-11-27 22:36:19,621 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:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-11-27 22:36:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2019-11-27 22:36:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-11-27 22:36:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2019-11-27 22:36:19,669 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2019-11-27 22:36:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,669 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2019-11-27 22:36:19,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2019-11-27 22:36:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 22:36:19,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:19,673 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash 911833163, now seen corresponding path program 1 times [2019-11-27 22:36:19,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350089892] [2019-11-27 22:36:19,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,694 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:19,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350089892] [2019-11-27 22:36:19,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764794149] [2019-11-27 22:36:19,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,696 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand 3 states. [2019-11-27 22:36:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,741 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2019-11-27 22:36:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 22:36:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,749 INFO L225 Difference]: With dead ends: 2952 [2019-11-27 22:36:19,750 INFO L226 Difference]: Without dead ends: 1702 [2019-11-27 22:36:19,752 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:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-11-27 22:36:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2019-11-27 22:36:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-11-27 22:36:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2019-11-27 22:36:19,818 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2019-11-27 22:36:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,818 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2019-11-27 22:36:19,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2019-11-27 22:36:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:36:19,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:19,822 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1210921629, now seen corresponding path program 1 times [2019-11-27 22:36:19,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841213940] [2019-11-27 22:36:19,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:19,845 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:19,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841213940] [2019-11-27 22:36:19,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:19,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:19,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119881843] [2019-11-27 22:36:19,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:19,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:19,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:19,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:19,848 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand 3 states. [2019-11-27 22:36:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:19,898 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2019-11-27 22:36:19,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:19,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:36:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:19,909 INFO L225 Difference]: With dead ends: 2552 [2019-11-27 22:36:19,909 INFO L226 Difference]: Without dead ends: 1734 [2019-11-27 22:36:19,911 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:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-27 22:36:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-11-27 22:36:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-11-27 22:36:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2019-11-27 22:36:19,993 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2019-11-27 22:36:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:19,993 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2019-11-27 22:36:19,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2019-11-27 22:36:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:36:19,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:19,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:19,998 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1797727643, now seen corresponding path program 1 times [2019-11-27 22:36:19,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:19,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988875259] [2019-11-27 22:36:20,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:20,024 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:20,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988875259] [2019-11-27 22:36:20,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:20,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:20,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517458852] [2019-11-27 22:36:20,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:20,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:20,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:20,026 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand 3 states. [2019-11-27 22:36:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:20,098 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2019-11-27 22:36:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:20,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:36:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:20,115 INFO L225 Difference]: With dead ends: 2952 [2019-11-27 22:36:20,115 INFO L226 Difference]: Without dead ends: 2950 [2019-11-27 22:36:20,117 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:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-11-27 22:36:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2019-11-27 22:36:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-11-27 22:36:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2019-11-27 22:36:20,257 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2019-11-27 22:36:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:20,258 INFO L462 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2019-11-27 22:36:20,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2019-11-27 22:36:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:36:20,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:20,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:20,265 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1539562205, now seen corresponding path program 1 times [2019-11-27 22:36:20,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:20,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177132281] [2019-11-27 22:36:20,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:20,289 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:20,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177132281] [2019-11-27 22:36:20,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:20,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:20,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748269219] [2019-11-27 22:36:20,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:20,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:20,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:20,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:20,291 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand 3 states. [2019-11-27 22:36:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:20,383 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2019-11-27 22:36:20,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:20,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 22:36:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:20,399 INFO L225 Difference]: With dead ends: 5832 [2019-11-27 22:36:20,400 INFO L226 Difference]: Without dead ends: 3334 [2019-11-27 22:36:20,403 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:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-27 22:36:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2019-11-27 22:36:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-27 22:36:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2019-11-27 22:36:20,516 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2019-11-27 22:36:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:20,516 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2019-11-27 22:36:20,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2019-11-27 22:36:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:36:20,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:20,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:20,521 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash 105233632, now seen corresponding path program 1 times [2019-11-27 22:36:20,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:20,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325642087] [2019-11-27 22:36:20,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:20,537 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:20,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325642087] [2019-11-27 22:36:20,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:20,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:20,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396257804] [2019-11-27 22:36:20,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:20,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:20,539 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand 3 states. [2019-11-27 22:36:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:20,596 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2019-11-27 22:36:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:20,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:36:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:20,611 INFO L225 Difference]: With dead ends: 5000 [2019-11-27 22:36:20,611 INFO L226 Difference]: Without dead ends: 3398 [2019-11-27 22:36:20,614 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:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-27 22:36:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2019-11-27 22:36:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2019-11-27 22:36:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2019-11-27 22:36:20,718 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2019-11-27 22:36:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:20,719 INFO L462 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2019-11-27 22:36:20,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2019-11-27 22:36:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:36:20,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:20,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:20,723 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash -481572382, now seen corresponding path program 1 times [2019-11-27 22:36:20,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:20,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286495710] [2019-11-27 22:36:20,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:20,743 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:20,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286495710] [2019-11-27 22:36:20,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:20,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:20,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353485086] [2019-11-27 22:36:20,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:20,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:20,745 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand 3 states. [2019-11-27 22:36:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:20,842 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2019-11-27 22:36:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:20,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:36:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:20,868 INFO L225 Difference]: With dead ends: 5640 [2019-11-27 22:36:20,868 INFO L226 Difference]: Without dead ends: 5638 [2019-11-27 22:36:20,871 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:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-11-27 22:36:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2019-11-27 22:36:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-11-27 22:36:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2019-11-27 22:36:21,006 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2019-11-27 22:36:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:21,007 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2019-11-27 22:36:21,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2019-11-27 22:36:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:36:21,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:21,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:21,014 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash -223406944, now seen corresponding path program 1 times [2019-11-27 22:36:21,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:21,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602540013] [2019-11-27 22:36:21,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:21,040 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:21,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602540013] [2019-11-27 22:36:21,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:21,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:21,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009559544] [2019-11-27 22:36:21,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:21,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:21,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:21,042 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand 3 states. [2019-11-27 22:36:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:21,137 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2019-11-27 22:36:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:21,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-27 22:36:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:21,154 INFO L225 Difference]: With dead ends: 11528 [2019-11-27 22:36:21,154 INFO L226 Difference]: Without dead ends: 6534 [2019-11-27 22:36:21,160 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:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-11-27 22:36:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2019-11-27 22:36:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-11-27 22:36:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2019-11-27 22:36:21,319 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2019-11-27 22:36:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:21,319 INFO L462 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2019-11-27 22:36:21,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2019-11-27 22:36:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:36:21,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:21,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:21,330 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2043625896, now seen corresponding path program 1 times [2019-11-27 22:36:21,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:21,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701098554] [2019-11-27 22:36:21,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:21,365 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:21,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701098554] [2019-11-27 22:36:21,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:21,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:21,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238807025] [2019-11-27 22:36:21,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:21,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:21,368 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand 3 states. [2019-11-27 22:36:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:21,471 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2019-11-27 22:36:21,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:21,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:36:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:21,484 INFO L225 Difference]: With dead ends: 9800 [2019-11-27 22:36:21,484 INFO L226 Difference]: Without dead ends: 6662 [2019-11-27 22:36:21,490 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:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2019-11-27 22:36:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2019-11-27 22:36:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-27 22:36:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2019-11-27 22:36:21,722 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2019-11-27 22:36:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:21,722 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2019-11-27 22:36:21,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2019-11-27 22:36:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:36:21,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:21,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:21,730 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1664535386, now seen corresponding path program 1 times [2019-11-27 22:36:21,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:21,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064811451] [2019-11-27 22:36:21,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:21,759 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:21,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064811451] [2019-11-27 22:36:21,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:21,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:21,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350455461] [2019-11-27 22:36:21,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:21,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:21,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:21,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:21,761 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand 3 states. [2019-11-27 22:36:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:21,896 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2019-11-27 22:36:21,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:21,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:36:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:21,914 INFO L225 Difference]: With dead ends: 10758 [2019-11-27 22:36:21,914 INFO L226 Difference]: Without dead ends: 10756 [2019-11-27 22:36:21,918 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:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-11-27 22:36:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2019-11-27 22:36:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-11-27 22:36:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2019-11-27 22:36:22,132 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2019-11-27 22:36:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:22,132 INFO L462 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2019-11-27 22:36:22,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2019-11-27 22:36:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:36:22,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:22,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:22,146 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:22,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1922700824, now seen corresponding path program 1 times [2019-11-27 22:36:22,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:22,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178031738] [2019-11-27 22:36:22,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:22,161 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:22,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178031738] [2019-11-27 22:36:22,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:22,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:22,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057650073] [2019-11-27 22:36:22,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:22,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:22,163 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand 3 states. [2019-11-27 22:36:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:22,326 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2019-11-27 22:36:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:22,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:36:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:22,327 INFO L225 Difference]: With dead ends: 22788 [2019-11-27 22:36:22,327 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:22,347 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:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:22,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-27 22:36:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:22,348 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:22,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:22,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:22,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:22,369 INFO L246 CegarLoopResult]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,369 INFO L246 CegarLoopResult]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,369 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-27 22:36:22,369 INFO L246 CegarLoopResult]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,369 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-27 22:36:22,369 INFO L246 CegarLoopResult]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:22,370 INFO L246 CegarLoopResult]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-11-27 22:36:22,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:22,370 INFO L246 CegarLoopResult]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,370 INFO L246 CegarLoopResult]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,370 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-27 22:36:22,370 INFO L249 CegarLoopResult]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,371 INFO L246 CegarLoopResult]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,373 INFO L249 CegarLoopResult]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-11-27 22:36:22,373 INFO L246 CegarLoopResult]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,373 INFO L246 CegarLoopResult]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,374 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-11-27 22:36:22,374 INFO L249 CegarLoopResult]: At program point L148(lines 4 149) the Hoare annotation is: true [2019-11-27 22:36:22,374 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-27 22:36:22,374 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-27 22:36:22,374 INFO L242 CegarLoopResult]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-11-27 22:36:22,374 INFO L246 CegarLoopResult]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,374 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:22,374 INFO L246 CegarLoopResult]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,375 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 22:36:22,375 INFO L246 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-27 22:36:22,375 INFO L246 CegarLoopResult]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,375 INFO L246 CegarLoopResult]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-11-27 22:36:22,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:22 BoogieIcfgContainer [2019-11-27 22:36:22,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:22,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:22,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:22,394 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:22,394 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:17" (3/4) ... [2019-11-27 22:36:22,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:22,418 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:36:22,418 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:22,510 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:22,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:22,513 INFO L168 Benchmark]: Toolchain (without parser) took 5793.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 959.0 MB in the beginning and 1.0 GB in the end (delta: -77.6 MB). Peak memory consumption was 262.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:22,513 INFO L168 Benchmark]: CDTParser took 0.19 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:22,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 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:22,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:22,514 INFO L168 Benchmark]: Boogie Preprocessor took 53.87 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:22,515 INFO L168 Benchmark]: RCFGBuilder took 366.89 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:22,515 INFO L168 Benchmark]: TraceAbstraction took 4725.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:22,516 INFO L168 Benchmark]: Witness Printer took 117.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:22,518 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.19 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 393.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 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 120.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.87 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 366.89 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4725.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.2 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. * Witness Printer took 117.14 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 36]: Loop Invariant Derived loop invariant: 1 - 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 4.5s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1841 SDtfs, 922 SDslu, 1207 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...