./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:59:28,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:59:28,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:59:28,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:59:28,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:59:28,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:59:28,282 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:59:28,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:59:28,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:59:28,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:59:28,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:59:28,288 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:59:28,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:59:28,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:59:28,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:59:28,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:59:28,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:59:28,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:59:28,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:59:28,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:59:28,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:59:28,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:59:28,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:59:28,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:59:28,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:59:28,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:59:28,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:59:28,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:59:28,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:59:28,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:59:28,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:59:28,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:59:28,311 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:59:28,311 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:59:28,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:59:28,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:59:28,314 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:59:28,342 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:59:28,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:59:28,344 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:59:28,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:59:28,344 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:59:28,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:59:28,344 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:59:28,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:59:28,345 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:59:28,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:59:28,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:59:28,346 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:59:28,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:59:28,346 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:59:28,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:59:28,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:59:28,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:59:28,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:59:28,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:59:28,348 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:59:28,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:59:28,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:59:28,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:59:28,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:59:28,349 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:59:28,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:59:28,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:59:28,349 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-01-14 14:59:28,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:59:28,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:59:28,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:59:28,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:59:28,422 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:59:28,422 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:28,478 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a74f3c2/dab0ff5fb375437a8f79644d16db8337/FLAG4e77465de [2019-01-14 14:59:28,893 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:59:28,894 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:28,902 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a74f3c2/dab0ff5fb375437a8f79644d16db8337/FLAG4e77465de [2019-01-14 14:59:29,249 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a74f3c2/dab0ff5fb375437a8f79644d16db8337 [2019-01-14 14:59:29,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:59:29,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:59:29,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:29,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:59:29,259 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:59:29,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bce7c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29, skipping insertion in model container [2019-01-14 14:59:29,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:59:29,300 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:59:29,537 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:29,543 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:59:29,587 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:29,608 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:59:29,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29 WrapperNode [2019-01-14 14:59:29,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:29,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:29,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:59:29,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:59:29,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:29,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:59:29,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:59:29,648 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:59:29,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (1/1) ... [2019-01-14 14:59:29,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:59:29,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:59:29,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:59:29,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:59:29,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (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-01-14 14:59:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:59:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:59:30,326 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:59:30,327 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 14:59:30,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:30 BoogieIcfgContainer [2019-01-14 14:59:30,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:59:30,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:59:30,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:59:30,332 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:59:30,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:59:29" (1/3) ... [2019-01-14 14:59:30,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd0b4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:30, skipping insertion in model container [2019-01-14 14:59:30,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:29" (2/3) ... [2019-01-14 14:59:30,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd0b4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:30, skipping insertion in model container [2019-01-14 14:59:30,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:30" (3/3) ... [2019-01-14 14:59:30,335 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:30,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:59:30,351 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:59:30,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:59:30,395 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:59:30,396 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:59:30,396 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:59:30,396 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:59:30,396 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:59:30,396 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:59:30,397 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:59:30,397 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:59:30,397 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:59:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-01-14 14:59:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 14:59:30,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:30,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:30,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:30,427 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2019-01-14 14:59:30,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:30,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:30,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:30,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:30,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:30,654 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-01-14 14:59:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:30,727 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2019-01-14 14:59:30,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:30,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 14:59:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:30,740 INFO L225 Difference]: With dead ends: 88 [2019-01-14 14:59:30,740 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 14:59:30,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 14:59:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-01-14 14:59:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 14:59:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2019-01-14 14:59:30,785 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2019-01-14 14:59:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:30,785 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2019-01-14 14:59:30,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2019-01-14 14:59:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 14:59:30,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:30,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:30,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2019-01-14 14:59:30,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:30,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:30,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:30,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:30,865 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2019-01-14 14:59:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:30,929 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2019-01-14 14:59:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:30,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 14:59:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:30,934 INFO L225 Difference]: With dead ends: 123 [2019-01-14 14:59:30,934 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 14:59:30,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 14:59:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-01-14 14:59:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 14:59:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2019-01-14 14:59:30,946 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2019-01-14 14:59:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:30,947 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2019-01-14 14:59:30,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2019-01-14 14:59:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 14:59:30,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:30,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:30,948 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2019-01-14 14:59:30,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:30,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:30,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:30,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:30,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:31,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:31,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:31,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:31,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:31,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,006 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2019-01-14 14:59:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:31,079 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2019-01-14 14:59:31,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:31,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 14:59:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:31,081 INFO L225 Difference]: With dead ends: 113 [2019-01-14 14:59:31,082 INFO L226 Difference]: Without dead ends: 77 [2019-01-14 14:59:31,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-14 14:59:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-01-14 14:59:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 14:59:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2019-01-14 14:59:31,094 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2019-01-14 14:59:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:31,094 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2019-01-14 14:59:31,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2019-01-14 14:59:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 14:59:31,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:31,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:31,097 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2019-01-14 14:59:31,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:31,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:31,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:31,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:31,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:31,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:31,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,177 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2019-01-14 14:59:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:31,202 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2019-01-14 14:59:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:31,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 14:59:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:31,204 INFO L225 Difference]: With dead ends: 144 [2019-01-14 14:59:31,205 INFO L226 Difference]: Without dead ends: 142 [2019-01-14 14:59:31,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-14 14:59:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2019-01-14 14:59:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 14:59:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2019-01-14 14:59:31,224 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2019-01-14 14:59:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:31,225 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2019-01-14 14:59:31,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2019-01-14 14:59:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 14:59:31,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:31,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:31,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2019-01-14 14:59:31,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:31,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:31,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:31,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:31,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:31,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:31,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:31,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,310 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2019-01-14 14:59:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:31,407 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2019-01-14 14:59:31,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:31,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 14:59:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:31,409 INFO L225 Difference]: With dead ends: 240 [2019-01-14 14:59:31,409 INFO L226 Difference]: Without dead ends: 144 [2019-01-14 14:59:31,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-14 14:59:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-01-14 14:59:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-14 14:59:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2019-01-14 14:59:31,436 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2019-01-14 14:59:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:31,437 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2019-01-14 14:59:31,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2019-01-14 14:59:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:31,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:31,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:31,438 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2019-01-14 14:59:31,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:31,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:31,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:31,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:31,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,552 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2019-01-14 14:59:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:31,578 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2019-01-14 14:59:31,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:31,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:31,580 INFO L225 Difference]: With dead ends: 215 [2019-01-14 14:59:31,581 INFO L226 Difference]: Without dead ends: 146 [2019-01-14 14:59:31,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-14 14:59:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-01-14 14:59:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-14 14:59:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2019-01-14 14:59:31,594 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2019-01-14 14:59:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:31,594 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2019-01-14 14:59:31,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2019-01-14 14:59:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:31,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:31,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:31,601 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2019-01-14 14:59:31,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:31,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:31,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:31,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:31,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:31,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:31,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:31,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,696 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2019-01-14 14:59:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:31,730 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2019-01-14 14:59:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:31,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:31,733 INFO L225 Difference]: With dead ends: 416 [2019-01-14 14:59:31,733 INFO L226 Difference]: Without dead ends: 278 [2019-01-14 14:59:31,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-14 14:59:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-01-14 14:59:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-14 14:59:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2019-01-14 14:59:31,748 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2019-01-14 14:59:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:31,748 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2019-01-14 14:59:31,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2019-01-14 14:59:31,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:31,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:31,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:31,751 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:31,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2019-01-14 14:59:31,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:31,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:31,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:31,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:31,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:31,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:31,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,788 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2019-01-14 14:59:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:31,828 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2019-01-14 14:59:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:31,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:31,832 INFO L225 Difference]: With dead ends: 352 [2019-01-14 14:59:31,832 INFO L226 Difference]: Without dead ends: 350 [2019-01-14 14:59:31,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-14 14:59:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2019-01-14 14:59:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-14 14:59:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2019-01-14 14:59:31,847 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2019-01-14 14:59:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:31,848 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2019-01-14 14:59:31,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2019-01-14 14:59:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:31,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:31,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:31,851 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2019-01-14 14:59:31,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:31,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:31,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:31,918 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2019-01-14 14:59:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:32,010 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2019-01-14 14:59:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:32,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:32,015 INFO L225 Difference]: With dead ends: 516 [2019-01-14 14:59:32,015 INFO L226 Difference]: Without dead ends: 514 [2019-01-14 14:59:32,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-01-14 14:59:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2019-01-14 14:59:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-01-14 14:59:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2019-01-14 14:59:32,035 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2019-01-14 14:59:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:32,035 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2019-01-14 14:59:32,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2019-01-14 14:59:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:32,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:32,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:32,039 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2019-01-14 14:59:32,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:32,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:32,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:32,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:32,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:32,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,104 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2019-01-14 14:59:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:32,210 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2019-01-14 14:59:32,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:32,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:32,215 INFO L225 Difference]: With dead ends: 916 [2019-01-14 14:59:32,215 INFO L226 Difference]: Without dead ends: 538 [2019-01-14 14:59:32,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-14 14:59:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-01-14 14:59:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-01-14 14:59:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2019-01-14 14:59:32,238 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2019-01-14 14:59:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:32,238 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2019-01-14 14:59:32,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2019-01-14 14:59:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:32,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:32,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:32,242 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2019-01-14 14:59:32,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:32,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:32,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:32,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:32,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:32,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:32,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,317 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2019-01-14 14:59:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:32,411 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2019-01-14 14:59:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:32,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:32,416 INFO L225 Difference]: With dead ends: 812 [2019-01-14 14:59:32,416 INFO L226 Difference]: Without dead ends: 550 [2019-01-14 14:59:32,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-01-14 14:59:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-01-14 14:59:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-01-14 14:59:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2019-01-14 14:59:32,439 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2019-01-14 14:59:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:32,439 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2019-01-14 14:59:32,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2019-01-14 14:59:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:32,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:32,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:32,443 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2019-01-14 14:59:32,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:32,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:32,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:32,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:32,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:32,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:32,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:32,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,521 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2019-01-14 14:59:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:32,624 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2019-01-14 14:59:32,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:32,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:32,632 INFO L225 Difference]: With dead ends: 1000 [2019-01-14 14:59:32,633 INFO L226 Difference]: Without dead ends: 998 [2019-01-14 14:59:32,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-01-14 14:59:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2019-01-14 14:59:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-01-14 14:59:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2019-01-14 14:59:32,681 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2019-01-14 14:59:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:32,681 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2019-01-14 14:59:32,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2019-01-14 14:59:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:32,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:32,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:32,687 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2019-01-14 14:59:32,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:32,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:32,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:32,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:32,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:32,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,763 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2019-01-14 14:59:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:32,881 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2019-01-14 14:59:32,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:32,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:32,888 INFO L225 Difference]: With dead ends: 1816 [2019-01-14 14:59:32,888 INFO L226 Difference]: Without dead ends: 1062 [2019-01-14 14:59:32,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-01-14 14:59:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2019-01-14 14:59:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-01-14 14:59:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2019-01-14 14:59:32,934 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2019-01-14 14:59:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:32,934 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2019-01-14 14:59:32,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2019-01-14 14:59:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:32,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:32,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:32,938 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2019-01-14 14:59:32,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:32,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:32,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:33,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:33,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:33,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:33,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:33,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:33,013 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2019-01-14 14:59:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:33,115 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2019-01-14 14:59:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:33,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:33,123 INFO L225 Difference]: With dead ends: 1592 [2019-01-14 14:59:33,123 INFO L226 Difference]: Without dead ends: 1078 [2019-01-14 14:59:33,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-01-14 14:59:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2019-01-14 14:59:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-01-14 14:59:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2019-01-14 14:59:33,166 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2019-01-14 14:59:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:33,167 INFO L480 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2019-01-14 14:59:33,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2019-01-14 14:59:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:33,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:33,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:33,171 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2019-01-14 14:59:33,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:33,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:33,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:33,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:33,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:33,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-01-14 14:59:33,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:33,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:33,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:33,252 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2019-01-14 14:59:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:33,385 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2019-01-14 14:59:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:33,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:33,401 INFO L225 Difference]: With dead ends: 1928 [2019-01-14 14:59:33,401 INFO L226 Difference]: Without dead ends: 1926 [2019-01-14 14:59:33,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-01-14 14:59:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2019-01-14 14:59:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-01-14 14:59:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2019-01-14 14:59:33,487 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2019-01-14 14:59:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:33,488 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2019-01-14 14:59:33,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2019-01-14 14:59:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:33,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:33,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:33,495 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:33,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2019-01-14 14:59:33,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:33,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:33,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:33,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:33,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:33,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:33,575 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2019-01-14 14:59:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:33,723 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2019-01-14 14:59:33,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:33,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:33,736 INFO L225 Difference]: With dead ends: 3592 [2019-01-14 14:59:33,736 INFO L226 Difference]: Without dead ends: 2086 [2019-01-14 14:59:33,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-01-14 14:59:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2019-01-14 14:59:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-01-14 14:59:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2019-01-14 14:59:33,827 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2019-01-14 14:59:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:33,828 INFO L480 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2019-01-14 14:59:33,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2019-01-14 14:59:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:33,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:33,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:33,836 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:33,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2019-01-14 14:59:33,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:33,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:33,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:33,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:33,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:33,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:33,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:33,912 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2019-01-14 14:59:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:34,056 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2019-01-14 14:59:34,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:34,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:34,068 INFO L225 Difference]: With dead ends: 3128 [2019-01-14 14:59:34,068 INFO L226 Difference]: Without dead ends: 2118 [2019-01-14 14:59:34,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-01-14 14:59:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2019-01-14 14:59:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-01-14 14:59:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2019-01-14 14:59:34,152 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2019-01-14 14:59:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:34,153 INFO L480 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2019-01-14 14:59:34,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2019-01-14 14:59:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:34,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:34,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:34,158 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2019-01-14 14:59:34,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:34,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:34,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:34,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:34,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:34,225 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2019-01-14 14:59:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:34,390 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2019-01-14 14:59:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:34,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:34,407 INFO L225 Difference]: With dead ends: 3720 [2019-01-14 14:59:34,407 INFO L226 Difference]: Without dead ends: 3718 [2019-01-14 14:59:34,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:34,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-01-14 14:59:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2019-01-14 14:59:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-01-14 14:59:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2019-01-14 14:59:34,496 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2019-01-14 14:59:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:34,496 INFO L480 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2019-01-14 14:59:34,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2019-01-14 14:59:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:34,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:34,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:34,501 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2019-01-14 14:59:34,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:34,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:34,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:34,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:34,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:34,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:34,568 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2019-01-14 14:59:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:34,733 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2019-01-14 14:59:34,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:34,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:34,753 INFO L225 Difference]: With dead ends: 7112 [2019-01-14 14:59:34,754 INFO L226 Difference]: Without dead ends: 4102 [2019-01-14 14:59:34,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-01-14 14:59:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2019-01-14 14:59:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-01-14 14:59:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2019-01-14 14:59:34,901 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2019-01-14 14:59:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:34,901 INFO L480 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2019-01-14 14:59:34,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2019-01-14 14:59:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:34,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:34,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:34,907 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:34,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:34,907 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2019-01-14 14:59:34,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:34,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:34,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:34,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:34,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:34,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:34,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:34,974 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2019-01-14 14:59:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:35,132 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2019-01-14 14:59:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:35,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:35,160 INFO L225 Difference]: With dead ends: 6152 [2019-01-14 14:59:35,161 INFO L226 Difference]: Without dead ends: 4166 [2019-01-14 14:59:35,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-01-14 14:59:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2019-01-14 14:59:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-01-14 14:59:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2019-01-14 14:59:35,301 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2019-01-14 14:59:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:35,301 INFO L480 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2019-01-14 14:59:35,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2019-01-14 14:59:35,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:35,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:35,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:35,307 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:35,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2019-01-14 14:59:35,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:35,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:35,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:35,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:35,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:35,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:35,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:35,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:35,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:35,375 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2019-01-14 14:59:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:35,586 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2019-01-14 14:59:35,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:35,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:35,613 INFO L225 Difference]: With dead ends: 7176 [2019-01-14 14:59:35,613 INFO L226 Difference]: Without dead ends: 7174 [2019-01-14 14:59:35,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-01-14 14:59:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2019-01-14 14:59:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2019-01-14 14:59:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2019-01-14 14:59:35,771 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2019-01-14 14:59:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:35,771 INFO L480 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2019-01-14 14:59:35,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2019-01-14 14:59:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:35,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:35,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:35,781 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2019-01-14 14:59:35,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:35,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:35,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:35,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:35,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:35,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:35,853 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2019-01-14 14:59:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:36,093 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2019-01-14 14:59:36,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:36,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:36,111 INFO L225 Difference]: With dead ends: 14088 [2019-01-14 14:59:36,111 INFO L226 Difference]: Without dead ends: 8070 [2019-01-14 14:59:36,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2019-01-14 14:59:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2019-01-14 14:59:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2019-01-14 14:59:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2019-01-14 14:59:36,416 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2019-01-14 14:59:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:36,416 INFO L480 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2019-01-14 14:59:36,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2019-01-14 14:59:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:36,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:36,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:36,428 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:36,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2019-01-14 14:59:36,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:36,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:36,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:36,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:36,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:36,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:36,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:36,501 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2019-01-14 14:59:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:36,713 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2019-01-14 14:59:36,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:36,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:36,729 INFO L225 Difference]: With dead ends: 12104 [2019-01-14 14:59:36,729 INFO L226 Difference]: Without dead ends: 8198 [2019-01-14 14:59:36,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-01-14 14:59:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2019-01-14 14:59:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-01-14 14:59:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2019-01-14 14:59:36,943 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2019-01-14 14:59:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:36,944 INFO L480 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2019-01-14 14:59:36,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2019-01-14 14:59:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:36,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:36,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:36,955 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2019-01-14 14:59:36,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:36,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:36,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:37,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:37,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:37,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:37,034 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2019-01-14 14:59:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:37,311 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2019-01-14 14:59:37,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:37,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:37,334 INFO L225 Difference]: With dead ends: 13832 [2019-01-14 14:59:37,335 INFO L226 Difference]: Without dead ends: 13830 [2019-01-14 14:59:37,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-01-14 14:59:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2019-01-14 14:59:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-01-14 14:59:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2019-01-14 14:59:37,624 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2019-01-14 14:59:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:37,624 INFO L480 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2019-01-14 14:59:37,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2019-01-14 14:59:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:37,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:37,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:37,646 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2019-01-14 14:59:37,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:37,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:37,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:37,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:37,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:37,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:37,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:37,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:37,718 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2019-01-14 14:59:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:38,228 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2019-01-14 14:59:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:38,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:38,268 INFO L225 Difference]: With dead ends: 27912 [2019-01-14 14:59:38,268 INFO L226 Difference]: Without dead ends: 15878 [2019-01-14 14:59:38,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2019-01-14 14:59:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2019-01-14 14:59:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-01-14 14:59:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2019-01-14 14:59:38,789 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2019-01-14 14:59:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:38,789 INFO L480 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2019-01-14 14:59:38,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2019-01-14 14:59:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:38,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:38,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:38,810 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2019-01-14 14:59:38,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:38,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:38,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:38,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:38,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:38,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:38,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:38,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:38,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:38,886 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2019-01-14 14:59:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:39,163 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2019-01-14 14:59:39,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:39,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:39,192 INFO L225 Difference]: With dead ends: 23816 [2019-01-14 14:59:39,192 INFO L226 Difference]: Without dead ends: 16134 [2019-01-14 14:59:39,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-01-14 14:59:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2019-01-14 14:59:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-01-14 14:59:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2019-01-14 14:59:39,738 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2019-01-14 14:59:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:39,738 INFO L480 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2019-01-14 14:59:39,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2019-01-14 14:59:39,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:39,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:39,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:39,757 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2019-01-14 14:59:39,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:39,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:39,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:39,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:39,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:39,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:39,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,831 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2019-01-14 14:59:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,183 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2019-01-14 14:59:40,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,236 INFO L225 Difference]: With dead ends: 26632 [2019-01-14 14:59:40,237 INFO L226 Difference]: Without dead ends: 26630 [2019-01-14 14:59:40,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2019-01-14 14:59:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2019-01-14 14:59:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2019-01-14 14:59:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2019-01-14 14:59:40,855 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2019-01-14 14:59:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,855 INFO L480 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2019-01-14 14:59:40,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2019-01-14 14:59:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:40,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:40,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:40,886 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2019-01-14 14:59:40,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:40,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:40,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:40,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:40,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,960 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2019-01-14 14:59:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:41,612 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2019-01-14 14:59:41,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:41,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:41,649 INFO L225 Difference]: With dead ends: 55304 [2019-01-14 14:59:41,649 INFO L226 Difference]: Without dead ends: 31238 [2019-01-14 14:59:41,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2019-01-14 14:59:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2019-01-14 14:59:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2019-01-14 14:59:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2019-01-14 14:59:42,388 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2019-01-14 14:59:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:42,389 INFO L480 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2019-01-14 14:59:42,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2019-01-14 14:59:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:42,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:42,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:42,402 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2019-01-14 14:59:42,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:42,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:42,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:42,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:42,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,469 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2019-01-14 14:59:42,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:42,854 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2019-01-14 14:59:42,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:42,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:42,881 INFO L225 Difference]: With dead ends: 46856 [2019-01-14 14:59:42,881 INFO L226 Difference]: Without dead ends: 31750 [2019-01-14 14:59:42,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2019-01-14 14:59:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2019-01-14 14:59:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-01-14 14:59:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2019-01-14 14:59:43,712 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2019-01-14 14:59:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:43,712 INFO L480 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2019-01-14 14:59:43,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2019-01-14 14:59:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:43,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:43,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:43,724 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:43,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2019-01-14 14:59:43,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:43,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:43,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:43,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:43,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:43,785 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2019-01-14 14:59:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:44,527 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2019-01-14 14:59:44,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:44,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:44,560 INFO L225 Difference]: With dead ends: 92166 [2019-01-14 14:59:44,560 INFO L226 Difference]: Without dead ends: 31748 [2019-01-14 14:59:44,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2019-01-14 14:59:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2019-01-14 14:59:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-01-14 14:59:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2019-01-14 14:59:45,760 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2019-01-14 14:59:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,760 INFO L480 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2019-01-14 14:59:45,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2019-01-14 14:59:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:45,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:45,775 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2019-01-14 14:59:45,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:59:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,844 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2019-01-14 14:59:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:46,173 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2019-01-14 14:59:46,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:46,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:46,174 INFO L225 Difference]: With dead ends: 31748 [2019-01-14 14:59:46,174 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 14:59:46,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 14:59:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 14:59:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 14:59:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 14:59:46,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-01-14 14:59:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:46,185 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 14:59:46,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 14:59:46,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 14:59:46,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 14:59:46,270 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-14 14:59:46,271 INFO L451 ceAbstractionStarter]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-01-14 14:59:46,271 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-01-14 14:59:46,271 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-01-14 14:59:46,271 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,272 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-01-14 14:59:46,273 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-14 14:59:46,277 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,278 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,280 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-14 14:59:46,280 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-14 14:59:46,280 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-01-14 14:59:46,280 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,280 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,280 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-01-14 14:59:46,281 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-01-14 14:59:46,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:59:46 BoogieIcfgContainer [2019-01-14 14:59:46,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:59:46,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:59:46,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:59:46,299 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:59:46,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:30" (3/4) ... [2019-01-14 14:59:46,305 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 14:59:46,318 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 14:59:46,319 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 14:59:46,416 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:59:46,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:59:46,417 INFO L168 Benchmark]: Toolchain (without parser) took 17163.78 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 908.1 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -265.5 MB). Peak memory consumption was 642.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:46,420 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:59:46,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:46,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.10 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:46,422 INFO L168 Benchmark]: Boogie Preprocessor took 85.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:46,423 INFO L168 Benchmark]: RCFGBuilder took 594.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:46,423 INFO L168 Benchmark]: TraceAbstraction took 15967.58 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 797.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.3 MB). Peak memory consumption was 643.2 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:46,423 INFO L168 Benchmark]: Witness Printer took 119.75 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:59:46,428 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.10 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 594.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15967.58 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 797.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -154.3 MB). Peak memory consumption was 643.2 MB. Max. memory is 11.5 GB. * Witness Printer took 119.75 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 42 locations, 1 error locations. SAFE Result, 15.8s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2722 SDtfs, 1400 SDslu, 1804 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31748occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 31360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...