./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_6.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_6.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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:36:11,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:36:11,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:36:11,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:36:11,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:36:11,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:36:11,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:36:11,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:36:11,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:36:11,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:36:11,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:36:11,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:36:11,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:36:11,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:36:11,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:36:11,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:36:11,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:36:11,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:36:11,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:36:11,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:36:11,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:36:11,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:36:11,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:36:11,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:36:11,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:36:11,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:36:11,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:36:11,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:36:11,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:36:11,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:36:11,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:36:11,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:36:11,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:36:11,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:36:11,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:36:11,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:36:11,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:36:11,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:36:11,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:36:11,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:36:11,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:36:11,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:36:11,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:36:11,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:36:11,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:36:11,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:36:11,319 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:36:11,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:36:11,319 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:36:11,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:36:11,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:36:11,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:36:11,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:36:11,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:36:11,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:36:11,321 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:36:11,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:36:11,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:36:11,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:36:11,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:36:11,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:36:11,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:36:11,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:36:11,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:36:11,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:36:11,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:36:11,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:36:11,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:36:11,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:36:11,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:36:11,326 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-11-27 22:36:11,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:36:11,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:36:11,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:36:11,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:36:11,735 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:36:11,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2019-11-27 22:36:11,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cc68c20/6f10c309087c4bcfa54862160d8e3caa/FLAG487511b0a [2019-11-27 22:36:12,275 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:36:12,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2019-11-27 22:36:12,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cc68c20/6f10c309087c4bcfa54862160d8e3caa/FLAG487511b0a [2019-11-27 22:36:12,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cc68c20/6f10c309087c4bcfa54862160d8e3caa [2019-11-27 22:36:12,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:36:12,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:36:12,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:12,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:36:12,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:36:12,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:12" (1/1) ... [2019-11-27 22:36:12,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab6e674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:12, skipping insertion in model container [2019-11-27 22:36:12,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:36:12" (1/1) ... [2019-11-27 22:36:12,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:36:12,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:36:12,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:12,906 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:36:12,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:36:12,938 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:36:12,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:12 WrapperNode [2019-11-27 22:36:12,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:36:12,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:12,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:36:12,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:36:13,007 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:12" (1/1) ... [2019-11-27 22:36:13,013 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:12" (1/1) ... [2019-11-27 22:36:13,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:36:13,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:36:13,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:36:13,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:36:13,044 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:12" (1/1) ... [2019-11-27 22:36:13,045 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:12" (1/1) ... [2019-11-27 22:36:13,046 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:12" (1/1) ... [2019-11-27 22:36:13,046 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:12" (1/1) ... [2019-11-27 22:36:13,049 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:12" (1/1) ... [2019-11-27 22:36:13,062 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:12" (1/1) ... [2019-11-27 22:36:13,065 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:12" (1/1) ... [2019-11-27 22:36:13,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:36:13,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:36:13,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:36:13,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:36:13,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:36:13,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:36:13,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:36:13,417 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:36:13,418 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-27 22:36:13,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13 BoogieIcfgContainer [2019-11-27 22:36:13,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:36:13,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:36:13,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:36:13,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:36:13,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:36:12" (1/3) ... [2019-11-27 22:36:13,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d47e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:13, skipping insertion in model container [2019-11-27 22:36:13,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:36:12" (2/3) ... [2019-11-27 22:36:13,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d47e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:36:13, skipping insertion in model container [2019-11-27 22:36:13,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13" (3/3) ... [2019-11-27 22:36:13,429 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-11-27 22:36:13,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:36:13,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:36:13,464 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:36:13,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:36:13,487 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:36:13,487 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:36:13,487 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:36:13,488 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:36:13,488 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:36:13,488 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:36:13,488 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:36:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-27 22:36:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 22:36:13,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:13,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:13,509 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash 502900931, now seen corresponding path program 1 times [2019-11-27 22:36:13,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:13,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444823902] [2019-11-27 22:36:13,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:13,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444823902] [2019-11-27 22:36:13,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:13,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:13,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701846511] [2019-11-27 22:36:13,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:13,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:13,718 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-11-27 22:36:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:13,791 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-11-27 22:36:13,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:13,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-27 22:36:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:13,810 INFO L225 Difference]: With dead ends: 58 [2019-11-27 22:36:13,810 INFO L226 Difference]: Without dead ends: 44 [2019-11-27 22:36:13,817 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:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-27 22:36:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-11-27 22:36:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 22:36:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2019-11-27 22:36:13,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2019-11-27 22:36:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:13,876 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2019-11-27 22:36:13,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2019-11-27 22:36:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 22:36:13,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:13,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:13,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:13,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:13,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1182959301, now seen corresponding path program 1 times [2019-11-27 22:36:13,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:13,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514938367] [2019-11-27 22:36:13,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:13,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514938367] [2019-11-27 22:36:13,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:13,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:13,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956071048] [2019-11-27 22:36:13,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:13,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:13,958 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2019-11-27 22:36:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:13,980 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2019-11-27 22:36:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:13,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-27 22:36:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:13,982 INFO L225 Difference]: With dead ends: 73 [2019-11-27 22:36:13,982 INFO L226 Difference]: Without dead ends: 44 [2019-11-27 22:36:13,983 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:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-27 22:36:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-27 22:36:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 22:36:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-11-27 22:36:13,991 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2019-11-27 22:36:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:13,991 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-11-27 22:36:13,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-11-27 22:36:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:13,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:13,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:13,992 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1589725680, now seen corresponding path program 1 times [2019-11-27 22:36:13,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:13,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034851083] [2019-11-27 22:36:13,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034851083] [2019-11-27 22:36:14,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844267578] [2019-11-27 22:36:14,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,059 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-11-27 22:36:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,093 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-11-27 22:36:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,095 INFO L225 Difference]: With dead ends: 68 [2019-11-27 22:36:14,095 INFO L226 Difference]: Without dead ends: 47 [2019-11-27 22:36:14,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-27 22:36:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-27 22:36:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-27 22:36:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2019-11-27 22:36:14,103 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2019-11-27 22:36:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,104 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2019-11-27 22:36:14,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2019-11-27 22:36:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:14,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,106 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1982752690, now seen corresponding path program 1 times [2019-11-27 22:36:14,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175558516] [2019-11-27 22:36:14,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175558516] [2019-11-27 22:36:14,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469553823] [2019-11-27 22:36:14,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,140 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2019-11-27 22:36:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,170 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2019-11-27 22:36:14,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,172 INFO L225 Difference]: With dead ends: 84 [2019-11-27 22:36:14,172 INFO L226 Difference]: Without dead ends: 82 [2019-11-27 22:36:14,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-27 22:36:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-27 22:36:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-27 22:36:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2019-11-27 22:36:14,182 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2019-11-27 22:36:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,183 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2019-11-27 22:36:14,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2019-11-27 22:36:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 22:36:14,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,185 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1302694320, now seen corresponding path program 1 times [2019-11-27 22:36:14,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402397670] [2019-11-27 22:36:14,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402397670] [2019-11-27 22:36:14,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952478207] [2019-11-27 22:36:14,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,222 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 3 states. [2019-11-27 22:36:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,250 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2019-11-27 22:36:14,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-27 22:36:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,252 INFO L225 Difference]: With dead ends: 140 [2019-11-27 22:36:14,252 INFO L226 Difference]: Without dead ends: 84 [2019-11-27 22:36:14,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-27 22:36:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-27 22:36:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-27 22:36:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2019-11-27 22:36:14,262 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2019-11-27 22:36:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,263 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2019-11-27 22:36:14,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2019-11-27 22:36:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1335576262, now seen corresponding path program 1 times [2019-11-27 22:36:14,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341360596] [2019-11-27 22:36:14,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341360596] [2019-11-27 22:36:14,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647002325] [2019-11-27 22:36:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,304 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 3 states. [2019-11-27 22:36:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,326 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2019-11-27 22:36:14,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,328 INFO L225 Difference]: With dead ends: 125 [2019-11-27 22:36:14,328 INFO L226 Difference]: Without dead ends: 86 [2019-11-27 22:36:14,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-27 22:36:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-27 22:36:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-27 22:36:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2019-11-27 22:36:14,338 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2019-11-27 22:36:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,339 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2019-11-27 22:36:14,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2019-11-27 22:36:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,341 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1728603272, now seen corresponding path program 1 times [2019-11-27 22:36:14,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010958660] [2019-11-27 22:36:14,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010958660] [2019-11-27 22:36:14,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774817788] [2019-11-27 22:36:14,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,380 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand 3 states. [2019-11-27 22:36:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,413 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2019-11-27 22:36:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,415 INFO L225 Difference]: With dead ends: 236 [2019-11-27 22:36:14,415 INFO L226 Difference]: Without dead ends: 158 [2019-11-27 22:36:14,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-27 22:36:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-27 22:36:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 22:36:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2019-11-27 22:36:14,435 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2019-11-27 22:36:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,436 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2019-11-27 22:36:14,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2019-11-27 22:36:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:36:14,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,437 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1886305654, now seen corresponding path program 1 times [2019-11-27 22:36:14,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825252079] [2019-11-27 22:36:14,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825252079] [2019-11-27 22:36:14,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421432995] [2019-11-27 22:36:14,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,480 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand 3 states. [2019-11-27 22:36:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,512 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2019-11-27 22:36:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-27 22:36:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,514 INFO L225 Difference]: With dead ends: 192 [2019-11-27 22:36:14,514 INFO L226 Difference]: Without dead ends: 190 [2019-11-27 22:36:14,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-27 22:36:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2019-11-27 22:36:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-27 22:36:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2019-11-27 22:36:14,530 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2019-11-27 22:36:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,531 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2019-11-27 22:36:14,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2019-11-27 22:36:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,533 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2046878555, now seen corresponding path program 1 times [2019-11-27 22:36:14,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410119776] [2019-11-27 22:36:14,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410119776] [2019-11-27 22:36:14,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926846998] [2019-11-27 22:36:14,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,599 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 3 states. [2019-11-27 22:36:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,627 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-11-27 22:36:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,630 INFO L225 Difference]: With dead ends: 276 [2019-11-27 22:36:14,630 INFO L226 Difference]: Without dead ends: 274 [2019-11-27 22:36:14,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-27 22:36:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2019-11-27 22:36:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-27 22:36:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2019-11-27 22:36:14,645 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2019-11-27 22:36:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,645 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2019-11-27 22:36:14,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2019-11-27 22:36:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:36:14,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1366820185, now seen corresponding path program 1 times [2019-11-27 22:36:14,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202117925] [2019-11-27 22:36:14,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202117925] [2019-11-27 22:36:14,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416200226] [2019-11-27 22:36:14,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,681 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand 3 states. [2019-11-27 22:36:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,709 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2019-11-27 22:36:14,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-27 22:36:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,713 INFO L225 Difference]: With dead ends: 516 [2019-11-27 22:36:14,714 INFO L226 Difference]: Without dead ends: 298 [2019-11-27 22:36:14,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-27 22:36:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-11-27 22:36:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-27 22:36:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2019-11-27 22:36:14,745 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2019-11-27 22:36:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,748 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2019-11-27 22:36:14,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2019-11-27 22:36:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:14,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,755 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash 971489901, now seen corresponding path program 1 times [2019-11-27 22:36:14,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355284557] [2019-11-27 22:36:14,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355284557] [2019-11-27 22:36:14,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728041677] [2019-11-27 22:36:14,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,791 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand 3 states. [2019-11-27 22:36:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,822 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2019-11-27 22:36:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,825 INFO L225 Difference]: With dead ends: 452 [2019-11-27 22:36:14,828 INFO L226 Difference]: Without dead ends: 310 [2019-11-27 22:36:14,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-27 22:36:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-11-27 22:36:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-27 22:36:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2019-11-27 22:36:14,851 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2019-11-27 22:36:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,852 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2019-11-27 22:36:14,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2019-11-27 22:36:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:14,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,854 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,855 INFO L82 PathProgramCache]: Analyzing trace with hash 578462891, now seen corresponding path program 1 times [2019-11-27 22:36:14,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714125097] [2019-11-27 22:36:14,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714125097] [2019-11-27 22:36:14,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344911988] [2019-11-27 22:36:14,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,907 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand 3 states. [2019-11-27 22:36:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:14,936 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2019-11-27 22:36:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:14,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:14,941 INFO L225 Difference]: With dead ends: 520 [2019-11-27 22:36:14,942 INFO L226 Difference]: Without dead ends: 518 [2019-11-27 22:36:14,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-27 22:36:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2019-11-27 22:36:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-27 22:36:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2019-11-27 22:36:14,965 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2019-11-27 22:36:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:14,965 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2019-11-27 22:36:14,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2019-11-27 22:36:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 22:36:14,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:14,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:14,968 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1258521261, now seen corresponding path program 1 times [2019-11-27 22:36:14,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:14,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392208974] [2019-11-27 22:36:14,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:14,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392208974] [2019-11-27 22:36:14,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:14,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:14,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124437815] [2019-11-27 22:36:14,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:14,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:14,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:14,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:14,995 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand 3 states. [2019-11-27 22:36:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,021 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2019-11-27 22:36:15,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-27 22:36:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,025 INFO L225 Difference]: With dead ends: 1016 [2019-11-27 22:36:15,025 INFO L226 Difference]: Without dead ends: 582 [2019-11-27 22:36:15,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-27 22:36:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-11-27 22:36:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-27 22:36:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2019-11-27 22:36:15,049 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2019-11-27 22:36:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,049 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2019-11-27 22:36:15,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2019-11-27 22:36:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:15,051 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash 752696444, now seen corresponding path program 1 times [2019-11-27 22:36:15,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923208760] [2019-11-27 22:36:15,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:15,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923208760] [2019-11-27 22:36:15,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326905392] [2019-11-27 22:36:15,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,074 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand 3 states. [2019-11-27 22:36:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,095 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2019-11-27 22:36:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,099 INFO L225 Difference]: With dead ends: 872 [2019-11-27 22:36:15,099 INFO L226 Difference]: Without dead ends: 598 [2019-11-27 22:36:15,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-27 22:36:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-27 22:36:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-27 22:36:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2019-11-27 22:36:15,123 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2019-11-27 22:36:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,124 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2019-11-27 22:36:15,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2019-11-27 22:36:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:15,126 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 359669434, now seen corresponding path program 1 times [2019-11-27 22:36:15,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343067988] [2019-11-27 22:36:15,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:15,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343067988] [2019-11-27 22:36:15,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756629768] [2019-11-27 22:36:15,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,149 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand 3 states. [2019-11-27 22:36:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,181 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2019-11-27 22:36:15,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,187 INFO L225 Difference]: With dead ends: 966 [2019-11-27 22:36:15,187 INFO L226 Difference]: Without dead ends: 964 [2019-11-27 22:36:15,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-11-27 22:36:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2019-11-27 22:36:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-27 22:36:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2019-11-27 22:36:15,218 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2019-11-27 22:36:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,219 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2019-11-27 22:36:15,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2019-11-27 22:36:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:36:15,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:36:15,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:36:15,222 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:36:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:36:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1039727804, now seen corresponding path program 1 times [2019-11-27 22:36:15,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:36:15,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649333480] [2019-11-27 22:36:15,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:36:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:36:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:36:15,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649333480] [2019-11-27 22:36:15,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:36:15,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:36:15,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807353119] [2019-11-27 22:36:15,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:36:15,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:36:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:36:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,251 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand 3 states. [2019-11-27 22:36:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:36:15,288 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2019-11-27 22:36:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:36:15,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-27 22:36:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:36:15,290 INFO L225 Difference]: With dead ends: 1988 [2019-11-27 22:36:15,290 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:36:15,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:36:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:36:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:36:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:36:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:36:15,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-27 22:36:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:36:15,294 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:36:15,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:36:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:36:15,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:36:15,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:36:15,315 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-27 22:36:15,315 INFO L246 CegarLoopResult]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,315 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:36:15,315 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:36:15,315 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-27 22:36:15,316 INFO L249 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-11-27 22:36:15,316 INFO L246 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-11-27 22:36:15,316 INFO L246 CegarLoopResult]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,316 INFO L246 CegarLoopResult]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,316 INFO L246 CegarLoopResult]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,316 INFO L246 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-27 22:36:15,317 INFO L246 CegarLoopResult]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,317 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-27 22:36:15,317 INFO L246 CegarLoopResult]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,317 INFO L249 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-11-27 22:36:15,317 INFO L249 CegarLoopResult]: At program point L106(lines 4 107) the Hoare annotation is: true [2019-11-27 22:36:15,317 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-27 22:36:15,317 INFO L246 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-27 22:36:15,318 INFO L242 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-11-27 22:36:15,319 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-27 22:36:15,319 INFO L246 CegarLoopResult]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,319 INFO L246 CegarLoopResult]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,319 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:36:15,320 INFO L246 CegarLoopResult]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,320 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-27 22:36:15,320 INFO L246 CegarLoopResult]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,320 INFO L246 CegarLoopResult]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-11-27 22:36:15,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:36:15 BoogieIcfgContainer [2019-11-27 22:36:15,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:36:15,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:36:15,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:36:15,334 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:36:15,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:36:13" (3/4) ... [2019-11-27 22:36:15,339 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:36:15,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-27 22:36:15,354 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:36:15,418 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:36:15,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:36:15,422 INFO L168 Benchmark]: Toolchain (without parser) took 2718.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 959.0 MB in the beginning and 931.5 MB in the end (delta: 27.5 MB). Peak memory consumption was 166.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:15,422 INFO L168 Benchmark]: CDTParser took 0.29 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:15,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 946.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:15,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:15,424 INFO L168 Benchmark]: Boogie Preprocessor took 32.46 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:15,425 INFO L168 Benchmark]: RCFGBuilder took 351.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:15,425 INFO L168 Benchmark]: TraceAbstraction took 1912.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:15,426 INFO L168 Benchmark]: Witness Printer took 85.50 ms. Allocated memory is still 1.2 GB. Free memory was 938.1 MB in the beginning and 931.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:36:15,429 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.29 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 236.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 946.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.46 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 351.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1912.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 171.3 MB). Peak memory consumption was 171.3 MB. Max. memory is 11.5 GB. * Witness Printer took 85.50 ms. Allocated memory is still 1.2 GB. Free memory was 938.1 MB in the beginning and 931.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 1.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 812 SDtfs, 391 SDslu, 511 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...