./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.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 b9ebacab53db4f4e6d9f51b7145688401913e247 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:35:39,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:39,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:39,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:39,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:39,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:39,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:39,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:39,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:39,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:39,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:39,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:39,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:39,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:39,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:39,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:39,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:39,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:39,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:39,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:39,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:39,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:39,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:39,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:39,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:39,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:39,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:39,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:39,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:39,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:39,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:39,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:39,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:39,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:39,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:39,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:39,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:39,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:39,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:39,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:39,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:39,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:39,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:39,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:39,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:39,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:39,604 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:39,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:39,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:39,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:39,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:39,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:39,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:39,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:39,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:39,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:39,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:39,609 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:39,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:39,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:39,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:39,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:39,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:39,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:39,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:39,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:39,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:39,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:39,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:39,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:39,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-11-27 22:35:39,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:39,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:39,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:39,961 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:39,962 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:39,962 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-27 22:35:40,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b55746c7/8270ab3e5a4045349522174e79ff1cdd/FLAG69649aafd [2019-11-27 22:35:40,587 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:40,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-27 22:35:40,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b55746c7/8270ab3e5a4045349522174e79ff1cdd/FLAG69649aafd [2019-11-27 22:35:40,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b55746c7/8270ab3e5a4045349522174e79ff1cdd [2019-11-27 22:35:40,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:40,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:40,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:40,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:40,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:40,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:40" (1/1) ... [2019-11-27 22:35:40,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c8816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:40, skipping insertion in model container [2019-11-27 22:35:40,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:40" (1/1) ... [2019-11-27 22:35:40,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:40,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:41,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:41,218 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:41,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:41,378 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:41,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41 WrapperNode [2019-11-27 22:35:41,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:41,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:41,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:41,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:41,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:41,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:41,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:41,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:41,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... [2019-11-27 22:35:41,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:41,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:41,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:41,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:41,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:41,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:41,775 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:42,479 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-27 22:35:42,481 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-27 22:35:42,486 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:42,487 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:42,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:42 BoogieIcfgContainer [2019-11-27 22:35:42,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:42,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:42,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:42,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:42,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:40" (1/3) ... [2019-11-27 22:35:42,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c28681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:42, skipping insertion in model container [2019-11-27 22:35:42,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:41" (2/3) ... [2019-11-27 22:35:42,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c28681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:42, skipping insertion in model container [2019-11-27 22:35:42,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:42" (3/3) ... [2019-11-27 22:35:42,505 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-11-27 22:35:42,517 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:42,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:42,544 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:42,594 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:42,595 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:42,595 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:42,595 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:42,595 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:42,596 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:42,596 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:42,596 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-11-27 22:35:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 22:35:42,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:42,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:42,627 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-11-27 22:35:42,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:42,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165199077] [2019-11-27 22:35:42,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:42,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165199077] [2019-11-27 22:35:42,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:42,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:42,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356392855] [2019-11-27 22:35:42,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:42,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:42,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:42,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:42,877 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-11-27 22:35:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:43,199 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-11-27 22:35:43,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:43,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-27 22:35:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:43,225 INFO L225 Difference]: With dead ends: 352 [2019-11-27 22:35:43,226 INFO L226 Difference]: Without dead ends: 173 [2019-11-27 22:35:43,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-27 22:35:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-11-27 22:35:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-27 22:35:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-11-27 22:35:43,299 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-11-27 22:35:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:43,301 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-11-27 22:35:43,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-11-27 22:35:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 22:35:43,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:43,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:43,304 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:43,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-11-27 22:35:43,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:43,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69189056] [2019-11-27 22:35:43,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:43,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69189056] [2019-11-27 22:35:43,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:43,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:43,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476594678] [2019-11-27 22:35:43,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:43,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:43,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,369 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-11-27 22:35:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:43,542 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-11-27 22:35:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:43,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-27 22:35:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:43,545 INFO L225 Difference]: With dead ends: 357 [2019-11-27 22:35:43,545 INFO L226 Difference]: Without dead ends: 193 [2019-11-27 22:35:43,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-27 22:35:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-27 22:35:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-27 22:35:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-11-27 22:35:43,567 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-11-27 22:35:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:43,567 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-11-27 22:35:43,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-11-27 22:35:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 22:35:43,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:43,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:43,570 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:43,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:43,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-11-27 22:35:43,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:43,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108528593] [2019-11-27 22:35:43,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:43,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108528593] [2019-11-27 22:35:43,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:43,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:43,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636088482] [2019-11-27 22:35:43,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:43,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:43,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,677 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-11-27 22:35:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:43,871 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-11-27 22:35:43,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:43,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-27 22:35:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:43,874 INFO L225 Difference]: With dead ends: 387 [2019-11-27 22:35:43,874 INFO L226 Difference]: Without dead ends: 201 [2019-11-27 22:35:43,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-27 22:35:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-11-27 22:35:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-27 22:35:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-11-27 22:35:43,891 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-11-27 22:35:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:43,891 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-11-27 22:35:43,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-11-27 22:35:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 22:35:43,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:43,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:43,894 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-11-27 22:35:43,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:43,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225287260] [2019-11-27 22:35:43,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:43,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225287260] [2019-11-27 22:35:43,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:43,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:43,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884453757] [2019-11-27 22:35:43,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:43,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:43,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:43,985 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-11-27 22:35:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,147 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-11-27 22:35:44,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-27 22:35:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,151 INFO L225 Difference]: With dead ends: 392 [2019-11-27 22:35:44,151 INFO L226 Difference]: Without dead ends: 200 [2019-11-27 22:35:44,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-27 22:35:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-11-27 22:35:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-27 22:35:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-11-27 22:35:44,181 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-11-27 22:35:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,182 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-11-27 22:35:44,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-11-27 22:35:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:35:44,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,188 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-11-27 22:35:44,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740691524] [2019-11-27 22:35:44,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740691524] [2019-11-27 22:35:44,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944166880] [2019-11-27 22:35:44,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,258 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-11-27 22:35:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,393 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-11-27 22:35:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-27 22:35:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,395 INFO L225 Difference]: With dead ends: 403 [2019-11-27 22:35:44,396 INFO L226 Difference]: Without dead ends: 210 [2019-11-27 22:35:44,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-27 22:35:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-27 22:35:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-27 22:35:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-11-27 22:35:44,413 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-11-27 22:35:44,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,414 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-11-27 22:35:44,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-11-27 22:35:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:35:44,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,420 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-11-27 22:35:44,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40672865] [2019-11-27 22:35:44,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40672865] [2019-11-27 22:35:44,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994251092] [2019-11-27 22:35:44,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,488 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-11-27 22:35:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,621 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-11-27 22:35:44,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-27 22:35:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,623 INFO L225 Difference]: With dead ends: 403 [2019-11-27 22:35:44,623 INFO L226 Difference]: Without dead ends: 210 [2019-11-27 22:35:44,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-27 22:35:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-27 22:35:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-27 22:35:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-11-27 22:35:44,632 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-11-27 22:35:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,633 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-11-27 22:35:44,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-11-27 22:35:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:35:44,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,635 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-11-27 22:35:44,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597580921] [2019-11-27 22:35:44,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597580921] [2019-11-27 22:35:44,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:44,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337504594] [2019-11-27 22:35:44,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:44,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:44,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,681 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-11-27 22:35:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:44,833 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-11-27 22:35:44,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:44,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-27 22:35:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:44,836 INFO L225 Difference]: With dead ends: 403 [2019-11-27 22:35:44,836 INFO L226 Difference]: Without dead ends: 210 [2019-11-27 22:35:44,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-27 22:35:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-27 22:35:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-27 22:35:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-11-27 22:35:44,846 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-11-27 22:35:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:44,846 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-11-27 22:35:44,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-11-27 22:35:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:35:44,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:44,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:44,848 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-11-27 22:35:44,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:44,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566323079] [2019-11-27 22:35:44,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:44,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566323079] [2019-11-27 22:35:44,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:44,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:44,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164160460] [2019-11-27 22:35:44,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:44,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:44,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:44,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:44,894 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-11-27 22:35:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,182 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-11-27 22:35:45,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:45,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-27 22:35:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,186 INFO L225 Difference]: With dead ends: 599 [2019-11-27 22:35:45,186 INFO L226 Difference]: Without dead ends: 406 [2019-11-27 22:35:45,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-27 22:35:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-11-27 22:35:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-27 22:35:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-11-27 22:35:45,204 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-11-27 22:35:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,204 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-11-27 22:35:45,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-11-27 22:35:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-27 22:35:45,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,206 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-11-27 22:35:45,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494682916] [2019-11-27 22:35:45,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:45,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494682916] [2019-11-27 22:35:45,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356620593] [2019-11-27 22:35:45,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,255 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-11-27 22:35:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,420 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-11-27 22:35:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-27 22:35:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,423 INFO L225 Difference]: With dead ends: 841 [2019-11-27 22:35:45,423 INFO L226 Difference]: Without dead ends: 466 [2019-11-27 22:35:45,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-27 22:35:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-11-27 22:35:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-27 22:35:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-11-27 22:35:45,458 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-11-27 22:35:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,458 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-11-27 22:35:45,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-11-27 22:35:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-27 22:35:45,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,460 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,461 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-11-27 22:35:45,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604258013] [2019-11-27 22:35:45,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:45,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604258013] [2019-11-27 22:35:45,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612583011] [2019-11-27 22:35:45,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,496 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-11-27 22:35:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,664 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-11-27 22:35:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-27 22:35:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,670 INFO L225 Difference]: With dead ends: 930 [2019-11-27 22:35:45,672 INFO L226 Difference]: Without dead ends: 489 [2019-11-27 22:35:45,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-27 22:35:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-11-27 22:35:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-27 22:35:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-11-27 22:35:45,703 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-11-27 22:35:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,704 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-11-27 22:35:45,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-11-27 22:35:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-27 22:35:45,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,706 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,707 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-11-27 22:35:45,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778772339] [2019-11-27 22:35:45,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:35:45,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778772339] [2019-11-27 22:35:45,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542631427] [2019-11-27 22:35:45,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,755 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-11-27 22:35:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:45,911 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-11-27 22:35:45,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:45,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-27 22:35:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:45,916 INFO L225 Difference]: With dead ends: 987 [2019-11-27 22:35:45,916 INFO L226 Difference]: Without dead ends: 523 [2019-11-27 22:35:45,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-27 22:35:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-27 22:35:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-27 22:35:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-11-27 22:35:45,939 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-11-27 22:35:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:45,939 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-11-27 22:35:45,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-11-27 22:35:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-27 22:35:45,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:45,941 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:45,942 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-11-27 22:35:45,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:45,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540981075] [2019-11-27 22:35:45,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:35:45,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540981075] [2019-11-27 22:35:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:45,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974426001] [2019-11-27 22:35:45,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:45,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:45,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:45,983 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-11-27 22:35:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,146 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-11-27 22:35:46,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-27 22:35:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,150 INFO L225 Difference]: With dead ends: 1021 [2019-11-27 22:35:46,150 INFO L226 Difference]: Without dead ends: 523 [2019-11-27 22:35:46,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-27 22:35:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-27 22:35:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-27 22:35:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-11-27 22:35:46,175 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-11-27 22:35:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,175 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-11-27 22:35:46,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-11-27 22:35:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-27 22:35:46,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,177 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,177 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-11-27 22:35:46,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743719012] [2019-11-27 22:35:46,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 22:35:46,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743719012] [2019-11-27 22:35:46,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769635650] [2019-11-27 22:35:46,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,211 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-11-27 22:35:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,415 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-11-27 22:35:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-27 22:35:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,420 INFO L225 Difference]: With dead ends: 1068 [2019-11-27 22:35:46,420 INFO L226 Difference]: Without dead ends: 570 [2019-11-27 22:35:46,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-27 22:35:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-11-27 22:35:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-11-27 22:35:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-11-27 22:35:46,449 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-11-27 22:35:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,450 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-11-27 22:35:46,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-11-27 22:35:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-27 22:35:46,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,452 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,452 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-11-27 22:35:46,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4976821] [2019-11-27 22:35:46,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:46,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4976821] [2019-11-27 22:35:46,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587421269] [2019-11-27 22:35:46,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,505 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-11-27 22:35:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:46,828 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-11-27 22:35:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:46,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-27 22:35:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:46,832 INFO L225 Difference]: With dead ends: 1178 [2019-11-27 22:35:46,832 INFO L226 Difference]: Without dead ends: 617 [2019-11-27 22:35:46,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-27 22:35:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-27 22:35:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-27 22:35:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-11-27 22:35:46,858 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-11-27 22:35:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:46,858 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-11-27 22:35:46,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-11-27 22:35:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-27 22:35:46,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:46,861 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:46,862 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-11-27 22:35:46,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:46,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168663727] [2019-11-27 22:35:46,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:46,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168663727] [2019-11-27 22:35:46,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:46,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:46,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729501124] [2019-11-27 22:35:46,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:46,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:46,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:46,907 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-11-27 22:35:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,099 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-11-27 22:35:47,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-27 22:35:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,103 INFO L225 Difference]: With dead ends: 1221 [2019-11-27 22:35:47,104 INFO L226 Difference]: Without dead ends: 617 [2019-11-27 22:35:47,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-27 22:35:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-27 22:35:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-27 22:35:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-11-27 22:35:47,134 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-11-27 22:35:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,134 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-11-27 22:35:47,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-11-27 22:35:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:35:47,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,137 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,137 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-11-27 22:35:47,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441746735] [2019-11-27 22:35:47,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:35:47,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441746735] [2019-11-27 22:35:47,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998495659] [2019-11-27 22:35:47,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,185 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-11-27 22:35:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,364 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-11-27 22:35:47,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:35:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,368 INFO L225 Difference]: With dead ends: 1217 [2019-11-27 22:35:47,369 INFO L226 Difference]: Without dead ends: 613 [2019-11-27 22:35:47,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-27 22:35:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-11-27 22:35:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-27 22:35:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-11-27 22:35:47,396 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-11-27 22:35:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,396 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-11-27 22:35:47,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-11-27 22:35:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-27 22:35:47,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,399 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,399 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-11-27 22:35:47,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627855879] [2019-11-27 22:35:47,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-27 22:35:47,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627855879] [2019-11-27 22:35:47,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723975771] [2019-11-27 22:35:47,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,445 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-11-27 22:35:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,625 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-11-27 22:35:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-27 22:35:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,629 INFO L225 Difference]: With dead ends: 1275 [2019-11-27 22:35:47,629 INFO L226 Difference]: Without dead ends: 671 [2019-11-27 22:35:47,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-27 22:35:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-27 22:35:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-27 22:35:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-11-27 22:35:47,666 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-11-27 22:35:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,667 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-11-27 22:35:47,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-11-27 22:35:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-27 22:35:47,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,670 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,671 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-11-27 22:35:47,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203542205] [2019-11-27 22:35:47,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-27 22:35:47,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203542205] [2019-11-27 22:35:47,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937985541] [2019-11-27 22:35:47,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,731 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-11-27 22:35:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:47,893 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-11-27 22:35:47,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:47,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-27 22:35:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:47,897 INFO L225 Difference]: With dead ends: 1307 [2019-11-27 22:35:47,898 INFO L226 Difference]: Without dead ends: 671 [2019-11-27 22:35:47,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-27 22:35:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-27 22:35:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-27 22:35:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-11-27 22:35:47,931 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-11-27 22:35:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:47,931 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-11-27 22:35:47,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-11-27 22:35:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-27 22:35:47,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:47,934 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:47,934 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-11-27 22:35:47,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:47,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872345793] [2019-11-27 22:35:47,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:35:47,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872345793] [2019-11-27 22:35:47,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:47,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:47,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072506361] [2019-11-27 22:35:47,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:47,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:47,978 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-11-27 22:35:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,165 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-11-27 22:35:48,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-27 22:35:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,171 INFO L225 Difference]: With dead ends: 1343 [2019-11-27 22:35:48,172 INFO L226 Difference]: Without dead ends: 707 [2019-11-27 22:35:48,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-27 22:35:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-11-27 22:35:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-11-27 22:35:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-11-27 22:35:48,212 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-11-27 22:35:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,213 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-11-27 22:35:48,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-11-27 22:35:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:35:48,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,216 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:48,217 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,217 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-11-27 22:35:48,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466669146] [2019-11-27 22:35:48,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-27 22:35:48,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466669146] [2019-11-27 22:35:48,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:48,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691103679] [2019-11-27 22:35:48,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,291 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-11-27 22:35:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,488 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-11-27 22:35:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-27 22:35:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,493 INFO L225 Difference]: With dead ends: 1400 [2019-11-27 22:35:48,494 INFO L226 Difference]: Without dead ends: 708 [2019-11-27 22:35:48,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-27 22:35:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-11-27 22:35:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-27 22:35:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-11-27 22:35:48,527 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-11-27 22:35:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,528 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-11-27 22:35:48,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-11-27 22:35:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-27 22:35:48,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,530 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:48,530 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-11-27 22:35:48,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281930312] [2019-11-27 22:35:48,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-27 22:35:48,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281930312] [2019-11-27 22:35:48,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:48,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88986363] [2019-11-27 22:35:48,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,576 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-11-27 22:35:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,742 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-11-27 22:35:48,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-27 22:35:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,746 INFO L225 Difference]: With dead ends: 1432 [2019-11-27 22:35:48,747 INFO L226 Difference]: Without dead ends: 743 [2019-11-27 22:35:48,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-27 22:35:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-27 22:35:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-27 22:35:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-11-27 22:35:48,782 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-11-27 22:35:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:48,782 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-11-27 22:35:48,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-11-27 22:35:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-27 22:35:48,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:48,785 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:48,786 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-11-27 22:35:48,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:48,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107515915] [2019-11-27 22:35:48,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-27 22:35:48,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107515915] [2019-11-27 22:35:48,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:48,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:48,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098433957] [2019-11-27 22:35:48,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:48,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:48,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:48,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,833 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-11-27 22:35:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:48,987 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-11-27 22:35:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:48,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-27 22:35:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:48,992 INFO L225 Difference]: With dead ends: 1473 [2019-11-27 22:35:48,993 INFO L226 Difference]: Without dead ends: 743 [2019-11-27 22:35:48,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-27 22:35:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-27 22:35:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-27 22:35:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-11-27 22:35:49,031 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-11-27 22:35:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,031 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-11-27 22:35:49,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-11-27 22:35:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-27 22:35:49,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:49,034 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:49,034 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-11-27 22:35:49,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:49,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728001896] [2019-11-27 22:35:49,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-27 22:35:49,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728001896] [2019-11-27 22:35:49,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:49,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:49,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280839113] [2019-11-27 22:35:49,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:49,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,087 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-11-27 22:35:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,251 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-11-27 22:35:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:49,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-27 22:35:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,255 INFO L225 Difference]: With dead ends: 1509 [2019-11-27 22:35:49,255 INFO L226 Difference]: Without dead ends: 779 [2019-11-27 22:35:49,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-27 22:35:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-27 22:35:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-27 22:35:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-11-27 22:35:49,284 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-11-27 22:35:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,284 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-11-27 22:35:49,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-11-27 22:35:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-27 22:35:49,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:49,287 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:49,287 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-11-27 22:35:49,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:49,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796936985] [2019-11-27 22:35:49,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-27 22:35:49,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796936985] [2019-11-27 22:35:49,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:49,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:49,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827207470] [2019-11-27 22:35:49,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:49,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,354 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-11-27 22:35:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,491 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-11-27 22:35:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:49,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-27 22:35:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,496 INFO L225 Difference]: With dead ends: 1541 [2019-11-27 22:35:49,496 INFO L226 Difference]: Without dead ends: 779 [2019-11-27 22:35:49,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-27 22:35:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-27 22:35:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-27 22:35:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-11-27 22:35:49,528 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-11-27 22:35:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,528 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-11-27 22:35:49,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-11-27 22:35:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-27 22:35:49,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:49,531 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:49,532 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:49,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-11-27 22:35:49,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:49,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933711966] [2019-11-27 22:35:49,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-27 22:35:49,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933711966] [2019-11-27 22:35:49,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:49,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:49,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166276895] [2019-11-27 22:35:49,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:49,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,575 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-11-27 22:35:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,734 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-11-27 22:35:49,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:49,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-27 22:35:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,740 INFO L225 Difference]: With dead ends: 1567 [2019-11-27 22:35:49,740 INFO L226 Difference]: Without dead ends: 805 [2019-11-27 22:35:49,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-27 22:35:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-27 22:35:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-27 22:35:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-11-27 22:35:49,779 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-11-27 22:35:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:49,779 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-11-27 22:35:49,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-11-27 22:35:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-27 22:35:49,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:49,786 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:49,787 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-11-27 22:35:49,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:49,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783821172] [2019-11-27 22:35:49,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-27 22:35:49,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783821172] [2019-11-27 22:35:49,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:49,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:49,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395797114] [2019-11-27 22:35:49,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:49,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:49,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:49,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:49,842 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-11-27 22:35:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:49,993 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-11-27 22:35:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:49,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-27 22:35:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:49,998 INFO L225 Difference]: With dead ends: 1595 [2019-11-27 22:35:49,998 INFO L226 Difference]: Without dead ends: 805 [2019-11-27 22:35:50,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-27 22:35:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-27 22:35:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-27 22:35:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-11-27 22:35:50,036 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-11-27 22:35:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:50,037 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-11-27 22:35:50,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-11-27 22:35:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-27 22:35:50,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:50,040 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:50,041 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-11-27 22:35:50,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:50,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045042882] [2019-11-27 22:35:50,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-27 22:35:50,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045042882] [2019-11-27 22:35:50,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:50,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:50,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335292938] [2019-11-27 22:35:50,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:50,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:50,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,081 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-11-27 22:35:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:50,261 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-11-27 22:35:50,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:50,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-27 22:35:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:50,265 INFO L225 Difference]: With dead ends: 1650 [2019-11-27 22:35:50,265 INFO L226 Difference]: Without dead ends: 860 [2019-11-27 22:35:50,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-11-27 22:35:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-11-27 22:35:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-27 22:35:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-11-27 22:35:50,299 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-11-27 22:35:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:50,299 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-11-27 22:35:50,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-11-27 22:35:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-27 22:35:50,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:50,302 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:50,302 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-11-27 22:35:50,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:50,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796064390] [2019-11-27 22:35:50,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-27 22:35:50,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796064390] [2019-11-27 22:35:50,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:50,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:50,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934233130] [2019-11-27 22:35:50,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:50,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,357 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-11-27 22:35:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:50,568 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-11-27 22:35:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:50,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-27 22:35:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:50,573 INFO L225 Difference]: With dead ends: 1699 [2019-11-27 22:35:50,573 INFO L226 Difference]: Without dead ends: 844 [2019-11-27 22:35:50,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-11-27 22:35:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-11-27 22:35:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-27 22:35:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-11-27 22:35:50,609 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-11-27 22:35:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:50,610 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-11-27 22:35:50,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-11-27 22:35:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-27 22:35:50,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:50,613 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:50,613 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-11-27 22:35:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:50,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797272628] [2019-11-27 22:35:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-27 22:35:50,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797272628] [2019-11-27 22:35:50,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:50,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:50,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664996178] [2019-11-27 22:35:50,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:50,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:50,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:50,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,657 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-11-27 22:35:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:50,856 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-11-27 22:35:50,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:50,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-27 22:35:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:50,861 INFO L225 Difference]: With dead ends: 1665 [2019-11-27 22:35:50,861 INFO L226 Difference]: Without dead ends: 842 [2019-11-27 22:35:50,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-11-27 22:35:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-11-27 22:35:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-27 22:35:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-11-27 22:35:50,895 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-11-27 22:35:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:50,896 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-11-27 22:35:50,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-11-27 22:35:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-27 22:35:50,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:50,899 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:50,899 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-11-27 22:35:50,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:50,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064107609] [2019-11-27 22:35:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-27 22:35:50,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064107609] [2019-11-27 22:35:50,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:50,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:50,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584990254] [2019-11-27 22:35:50,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:50,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:50,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:50,958 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-11-27 22:35:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:51,160 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-11-27 22:35:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:51,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-27 22:35:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:51,165 INFO L225 Difference]: With dead ends: 1665 [2019-11-27 22:35:51,165 INFO L226 Difference]: Without dead ends: 825 [2019-11-27 22:35:51,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-11-27 22:35:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-11-27 22:35:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-27 22:35:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-11-27 22:35:51,217 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-11-27 22:35:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:51,217 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-11-27 22:35:51,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-11-27 22:35:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-27 22:35:51,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:51,222 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:51,223 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-11-27 22:35:51,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:51,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816878791] [2019-11-27 22:35:51,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-27 22:35:51,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816878791] [2019-11-27 22:35:51,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:51,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:51,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791643504] [2019-11-27 22:35:51,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:51,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:51,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:51,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:51,296 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-11-27 22:35:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:51,389 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-11-27 22:35:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:51,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-27 22:35:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:51,398 INFO L225 Difference]: With dead ends: 2411 [2019-11-27 22:35:51,398 INFO L226 Difference]: Without dead ends: 1605 [2019-11-27 22:35:51,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-11-27 22:35:51,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-11-27 22:35:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-27 22:35:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-11-27 22:35:51,465 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-11-27 22:35:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:51,466 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-11-27 22:35:51,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-11-27 22:35:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-27 22:35:51,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:51,471 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:51,471 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:51,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:51,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-11-27 22:35:51,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:51,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93441839] [2019-11-27 22:35:51,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-27 22:35:51,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93441839] [2019-11-27 22:35:51,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:51,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:51,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185699908] [2019-11-27 22:35:51,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:51,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:51,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:51,597 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-11-27 22:35:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:51,701 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-11-27 22:35:51,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:51,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-27 22:35:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:51,712 INFO L225 Difference]: With dead ends: 2410 [2019-11-27 22:35:51,712 INFO L226 Difference]: Without dead ends: 1602 [2019-11-27 22:35:51,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-11-27 22:35:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-11-27 22:35:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-27 22:35:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-11-27 22:35:51,803 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-11-27 22:35:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:51,804 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-11-27 22:35:51,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-11-27 22:35:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-27 22:35:51,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:51,807 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:51,808 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-11-27 22:35:51,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:51,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031105903] [2019-11-27 22:35:51,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-27 22:35:51,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031105903] [2019-11-27 22:35:51,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:51,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:51,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083048853] [2019-11-27 22:35:51,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:51,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:51,946 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-11-27 22:35:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:52,089 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-11-27 22:35:52,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:52,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-27 22:35:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:52,103 INFO L225 Difference]: With dead ends: 4746 [2019-11-27 22:35:52,103 INFO L226 Difference]: Without dead ends: 3153 [2019-11-27 22:35:52,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-11-27 22:35:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-11-27 22:35:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-27 22:35:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-11-27 22:35:52,187 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-11-27 22:35:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:52,187 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-11-27 22:35:52,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-11-27 22:35:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-27 22:35:52,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:52,191 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:52,191 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:52,192 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-11-27 22:35:52,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:52,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948647909] [2019-11-27 22:35:52,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-27 22:35:52,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948647909] [2019-11-27 22:35:52,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:52,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:52,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634790083] [2019-11-27 22:35:52,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:52,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:52,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:52,261 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-11-27 22:35:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:52,523 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-11-27 22:35:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:52,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-27 22:35:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:52,558 INFO L225 Difference]: With dead ends: 4786 [2019-11-27 22:35:52,558 INFO L226 Difference]: Without dead ends: 3193 [2019-11-27 22:35:52,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-11-27 22:35:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-11-27 22:35:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-11-27 22:35:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-11-27 22:35:52,765 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-11-27 22:35:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:52,766 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-11-27 22:35:52,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-11-27 22:35:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-27 22:35:52,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:52,770 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:52,770 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-11-27 22:35:52,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:52,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509603952] [2019-11-27 22:35:52,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:35:52,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:35:52,922 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:35:53,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:53 BoogieIcfgContainer [2019-11-27 22:35:53,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:53,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:53,012 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:53,013 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:53,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:42" (3/4) ... [2019-11-27 22:35:53,017 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:35:53,152 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:53,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:53,155 INFO L168 Benchmark]: Toolchain (without parser) took 12273.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.7 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -289.4 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:53,156 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:53,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -117.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:53,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.43 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:53,157 INFO L168 Benchmark]: Boogie Preprocessor took 44.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:53,157 INFO L168 Benchmark]: RCFGBuilder took 995.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.0 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:53,158 INFO L168 Benchmark]: TraceAbstraction took 10519.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:53,158 INFO L168 Benchmark]: Witness Printer took 140.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:53,160 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 495.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -117.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.43 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 995.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.0 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10519.71 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 259.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -265.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 140.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...