./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/bitvector/s3_srvr_3a.BV.c.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 3c83e1c64d2af1ac92027e4b29fb95a984369de1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:38:47,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:47,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:47,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:47,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:47,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:47,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:47,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:47,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:47,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:47,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:47,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:47,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:47,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:47,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:47,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:47,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:47,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:47,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:47,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:47,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:47,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:47,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:47,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:47,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:47,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:47,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:47,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:47,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:47,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:47,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:47,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:47,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:47,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:47,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:47,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:47,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:47,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:47,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:47,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:47,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:47,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:38:47,378 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:47,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:47,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:47,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:47,380 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:47,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:47,381 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:47,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:38:47,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:47,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:47,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:47,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:47,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:47,382 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:47,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:47,383 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:47,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:47,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:47,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:47,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:47,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:47,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:47,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:47,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:47,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:47,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:38:47,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:38:47,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:47,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:47,386 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 -> 3c83e1c64d2af1ac92027e4b29fb95a984369de1 [2019-11-28 15:38:47,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:47,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:47,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:47,719 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:47,720 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:47,720 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-28 15:38:47,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304cd5cd8/bc6f48709d814930ac9f8abb4f9c1e97/FLAGd12bf8bdc [2019-11-28 15:38:48,360 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:48,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2019-11-28 15:38:48,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304cd5cd8/bc6f48709d814930ac9f8abb4f9c1e97/FLAGd12bf8bdc [2019-11-28 15:38:48,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304cd5cd8/bc6f48709d814930ac9f8abb4f9c1e97 [2019-11-28 15:38:48,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:48,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:48,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:48,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:48,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:48,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:48" (1/1) ... [2019-11-28 15:38:48,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad782af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:48, skipping insertion in model container [2019-11-28 15:38:48,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:48" (1/1) ... [2019-11-28 15:38:48,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:48,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:49,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:49,023 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:49,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:49,179 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:49,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49 WrapperNode [2019-11-28 15:38:49,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:49,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:49,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:49,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:49,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:49,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:49,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:49,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:49,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (1/1) ... [2019-11-28 15:38:49,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:49,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:49,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:49,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:49,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (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-28 15:38:49,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:49,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:49,513 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:38:50,190 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:38:50,191 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:38:50,192 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:50,193 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:50,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:50 BoogieIcfgContainer [2019-11-28 15:38:50,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:50,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:50,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:50,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:50,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:48" (1/3) ... [2019-11-28 15:38:50,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba6b902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:50, skipping insertion in model container [2019-11-28 15:38:50,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:49" (2/3) ... [2019-11-28 15:38:50,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba6b902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:50, skipping insertion in model container [2019-11-28 15:38:50,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:50" (3/3) ... [2019-11-28 15:38:50,207 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2019-11-28 15:38:50,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:50,227 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:50,241 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:50,275 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:50,276 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:50,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:50,277 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:50,277 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:50,277 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:50,277 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:50,277 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-28 15:38:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:38:50,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:50,305 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-28 15:38:50,306 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-11-28 15:38:50,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:50,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240769524] [2019-11-28 15:38:50,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:50,556 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-28 15:38:50,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240769524] [2019-11-28 15:38:50,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:50,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:50,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978685225] [2019-11-28 15:38:50,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:50,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:50,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:50,583 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-28 15:38:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:50,955 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-11-28 15:38:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:50,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 15:38:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:50,973 INFO L225 Difference]: With dead ends: 322 [2019-11-28 15:38:50,973 INFO L226 Difference]: Without dead ends: 170 [2019-11-28 15:38:50,978 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-28 15:38:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-28 15:38:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-11-28 15:38:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-28 15:38:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-11-28 15:38:51,042 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-11-28 15:38:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:51,043 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-11-28 15:38:51,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-11-28 15:38:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:38:51,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:51,047 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-28 15:38:51,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-11-28 15:38:51,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:51,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74032298] [2019-11-28 15:38:51,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:51,209 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-28 15:38:51,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74032298] [2019-11-28 15:38:51,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:51,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:51,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112769726] [2019-11-28 15:38:51,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:51,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:51,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:51,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:51,217 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-11-28 15:38:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:51,488 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-11-28 15:38:51,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:51,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:38:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:51,494 INFO L225 Difference]: With dead ends: 371 [2019-11-28 15:38:51,496 INFO L226 Difference]: Without dead ends: 211 [2019-11-28 15:38:51,498 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-28 15:38:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-28 15:38:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-28 15:38:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 15:38:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-11-28 15:38:51,522 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-11-28 15:38:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:51,522 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-11-28 15:38:51,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-11-28 15:38:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 15:38:51,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:51,533 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, 1, 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-28 15:38:51,533 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:51,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-11-28 15:38:51,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:51,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284413926] [2019-11-28 15:38:51,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:51,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284413926] [2019-11-28 15:38:51,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:51,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:51,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219464426] [2019-11-28 15:38:51,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:51,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:51,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:51,633 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-11-28 15:38:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:51,825 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-11-28 15:38:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:51,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-28 15:38:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:51,829 INFO L225 Difference]: With dead ends: 436 [2019-11-28 15:38:51,830 INFO L226 Difference]: Without dead ends: 237 [2019-11-28 15:38:51,831 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-28 15:38:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-28 15:38:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-11-28 15:38:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-28 15:38:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-11-28 15:38:51,851 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-11-28 15:38:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:51,852 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-11-28 15:38:51,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-11-28 15:38:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:38:51,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:51,864 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:38:51,864 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-11-28 15:38:51,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:51,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052824933] [2019-11-28 15:38:51,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:51,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052824933] [2019-11-28 15:38:51,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:51,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:51,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22973393] [2019-11-28 15:38:51,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:51,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:51,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:51,950 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-11-28 15:38:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:52,121 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-11-28 15:38:52,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:52,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:38:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:52,125 INFO L225 Difference]: With dead ends: 484 [2019-11-28 15:38:52,125 INFO L226 Difference]: Without dead ends: 254 [2019-11-28 15:38:52,127 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-28 15:38:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-28 15:38:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-11-28 15:38:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-28 15:38:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-11-28 15:38:52,162 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-11-28 15:38:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:52,164 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-11-28 15:38:52,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-11-28 15:38:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:38:52,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:52,167 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:52,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-11-28 15:38:52,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:52,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815179465] [2019-11-28 15:38:52,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:52,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815179465] [2019-11-28 15:38:52,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:52,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:52,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217949292] [2019-11-28 15:38:52,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:52,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:52,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:52,275 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-11-28 15:38:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:52,524 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-11-28 15:38:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:52,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:38:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:52,532 INFO L225 Difference]: With dead ends: 543 [2019-11-28 15:38:52,532 INFO L226 Difference]: Without dead ends: 298 [2019-11-28 15:38:52,534 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-28 15:38:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-28 15:38:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-11-28 15:38:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-28 15:38:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-11-28 15:38:52,557 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-11-28 15:38:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:52,558 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-11-28 15:38:52,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-11-28 15:38:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:38:52,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:52,562 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-28 15:38:52,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-11-28 15:38:52,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:52,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007626709] [2019-11-28 15:38:52,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:52,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007626709] [2019-11-28 15:38:52,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:52,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:52,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678942138] [2019-11-28 15:38:52,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:52,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:52,663 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-11-28 15:38:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:52,823 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-11-28 15:38:52,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:52,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:38:52,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:52,826 INFO L225 Difference]: With dead ends: 583 [2019-11-28 15:38:52,826 INFO L226 Difference]: Without dead ends: 296 [2019-11-28 15:38:52,827 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-28 15:38:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-28 15:38:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-11-28 15:38:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-28 15:38:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-11-28 15:38:52,841 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-11-28 15:38:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:52,841 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-11-28 15:38:52,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-11-28 15:38:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:38:52,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:52,843 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:52,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-11-28 15:38:52,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:52,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797928737] [2019-11-28 15:38:52,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:52,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797928737] [2019-11-28 15:38:52,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:52,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:52,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844642601] [2019-11-28 15:38:52,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:52,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:52,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:52,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:52,892 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-11-28 15:38:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,077 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-11-28 15:38:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:53,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:38:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,080 INFO L225 Difference]: With dead ends: 585 [2019-11-28 15:38:53,080 INFO L226 Difference]: Without dead ends: 296 [2019-11-28 15:38:53,081 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-28 15:38:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-28 15:38:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-28 15:38:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-28 15:38:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-11-28 15:38:53,093 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-11-28 15:38:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,093 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-11-28 15:38:53,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-11-28 15:38:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 15:38:53,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,095 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:38:53,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-11-28 15:38:53,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:53,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842567870] [2019-11-28 15:38:53,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 15:38:53,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842567870] [2019-11-28 15:38:53,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862628872] [2019-11-28 15:38:53,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,155 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-11-28 15:38:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,278 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-11-28 15:38:53,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:53,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 15:38:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,281 INFO L225 Difference]: With dead ends: 585 [2019-11-28 15:38:53,282 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 15:38:53,283 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-28 15:38:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 15:38:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-28 15:38:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-28 15:38:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-11-28 15:38:53,294 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-11-28 15:38:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,295 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-11-28 15:38:53,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-11-28 15:38:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-28 15:38:53,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,297 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, 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-28 15:38:53,297 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-11-28 15:38:53,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:53,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630000965] [2019-11-28 15:38:53,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:53,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630000965] [2019-11-28 15:38:53,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701375312] [2019-11-28 15:38:53,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,353 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-11-28 15:38:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,539 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-11-28 15:38:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:53,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-28 15:38:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,542 INFO L225 Difference]: With dead ends: 624 [2019-11-28 15:38:53,542 INFO L226 Difference]: Without dead ends: 331 [2019-11-28 15:38:53,543 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-28 15:38:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-28 15:38:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-11-28 15:38:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-28 15:38:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-11-28 15:38:53,556 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-11-28 15:38:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,556 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-11-28 15:38:53,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-11-28 15:38:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 15:38:53,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,558 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, 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] [2019-11-28 15:38:53,558 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,559 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-11-28 15:38:53,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:53,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964503186] [2019-11-28 15:38:53,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:53,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964503186] [2019-11-28 15:38:53,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877116197] [2019-11-28 15:38:53,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,598 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-11-28 15:38:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:53,806 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-11-28 15:38:53,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:53,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-28 15:38:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:53,811 INFO L225 Difference]: With dead ends: 685 [2019-11-28 15:38:53,813 INFO L226 Difference]: Without dead ends: 363 [2019-11-28 15:38:53,814 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-28 15:38:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-28 15:38:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-28 15:38:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:38:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-11-28 15:38:53,838 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-11-28 15:38:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:53,840 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-11-28 15:38:53,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-11-28 15:38:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 15:38:53,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:53,845 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, 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-28 15:38:53,845 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:53,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-11-28 15:38:53,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:53,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388819418] [2019-11-28 15:38:53,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:53,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388819418] [2019-11-28 15:38:53,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:53,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:53,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614938149] [2019-11-28 15:38:53,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:53,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:53,927 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-11-28 15:38:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,125 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-11-28 15:38:54,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-28 15:38:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,130 INFO L225 Difference]: With dead ends: 707 [2019-11-28 15:38:54,130 INFO L226 Difference]: Without dead ends: 358 [2019-11-28 15:38:54,131 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-28 15:38:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-28 15:38:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-28 15:38:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:38:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-11-28 15:38:54,148 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-11-28 15:38:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,148 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-11-28 15:38:54,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-11-28 15:38:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 15:38:54,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,152 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, 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] [2019-11-28 15:38:54,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-11-28 15:38:54,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040576769] [2019-11-28 15:38:54,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:38:54,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040576769] [2019-11-28 15:38:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:54,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805924080] [2019-11-28 15:38:54,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,214 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-11-28 15:38:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,411 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-11-28 15:38:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 15:38:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,414 INFO L225 Difference]: With dead ends: 712 [2019-11-28 15:38:54,414 INFO L226 Difference]: Without dead ends: 363 [2019-11-28 15:38:54,415 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-28 15:38:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-28 15:38:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-11-28 15:38:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:38:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-11-28 15:38:54,430 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-11-28 15:38:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,431 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-11-28 15:38:54,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-11-28 15:38:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:38:54,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,433 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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-28 15:38:54,434 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-11-28 15:38:54,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065192974] [2019-11-28 15:38:54,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:54,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065192974] [2019-11-28 15:38:54,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:54,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947239823] [2019-11-28 15:38:54,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,491 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-11-28 15:38:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,645 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-11-28 15:38:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-28 15:38:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,649 INFO L225 Difference]: With dead ends: 730 [2019-11-28 15:38:54,649 INFO L226 Difference]: Without dead ends: 381 [2019-11-28 15:38:54,650 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-28 15:38:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-28 15:38:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-28 15:38:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 15:38:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-11-28 15:38:54,669 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-11-28 15:38:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,670 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-11-28 15:38:54,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-11-28 15:38:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 15:38:54,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,673 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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-28 15:38:54,673 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-11-28 15:38:54,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086487597] [2019-11-28 15:38:54,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:54,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086487597] [2019-11-28 15:38:54,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:54,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799071814] [2019-11-28 15:38:54,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,741 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-11-28 15:38:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,874 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-11-28 15:38:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-28 15:38:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,877 INFO L225 Difference]: With dead ends: 751 [2019-11-28 15:38:54,877 INFO L226 Difference]: Without dead ends: 381 [2019-11-28 15:38:54,878 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-28 15:38:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-28 15:38:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-28 15:38:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-28 15:38:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-11-28 15:38:54,893 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-11-28 15:38:54,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:54,893 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-11-28 15:38:54,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-11-28 15:38:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-28 15:38:54,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:54,896 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-28 15:38:54,896 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-11-28 15:38:54,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:54,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151342309] [2019-11-28 15:38:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 15:38:54,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151342309] [2019-11-28 15:38:54,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:54,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:54,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48713112] [2019-11-28 15:38:54,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:54,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:54,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:54,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:54,947 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-11-28 15:38:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:54,994 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-11-28 15:38:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:54,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-28 15:38:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:54,999 INFO L225 Difference]: With dead ends: 747 [2019-11-28 15:38:54,999 INFO L226 Difference]: Without dead ends: 745 [2019-11-28 15:38:55,001 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-28 15:38:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-11-28 15:38:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-11-28 15:38:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-11-28 15:38:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-11-28 15:38:55,028 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-11-28 15:38:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,028 INFO L462 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-11-28 15:38:55,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-11-28 15:38:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:38:55,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,031 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, 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-28 15:38:55,031 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-11-28 15:38:55,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849204888] [2019-11-28 15:38:55,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,042 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:55,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229402314] [2019-11-28 15:38:55,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,114 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:55,130 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:55,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849204888] [2019-11-28 15:38:55,177 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:55,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229402314] [2019-11-28 15:38:55,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:55,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954008739] [2019-11-28 15:38:55,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,181 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-11-28 15:38:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,250 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-11-28 15:38:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 15:38:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,256 INFO L225 Difference]: With dead ends: 1851 [2019-11-28 15:38:55,256 INFO L226 Difference]: Without dead ends: 1113 [2019-11-28 15:38:55,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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-28 15:38:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-11-28 15:38:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-11-28 15:38:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-11-28 15:38:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-11-28 15:38:55,300 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-11-28 15:38:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,300 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-11-28 15:38:55,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-11-28 15:38:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-28 15:38:55,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,304 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 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] [2019-11-28 15:38:55,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:55,509 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-11-28 15:38:55,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:55,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511859866] [2019-11-28 15:38:55,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:55,524 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:55,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061684182] [2019-11-28 15:38:55,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:55,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:55,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:38:55,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511859866] [2019-11-28 15:38:55,685 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:55,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061684182] [2019-11-28 15:38:55,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:55,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:55,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416512787] [2019-11-28 15:38:55,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:55,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:55,691 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-11-28 15:38:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:55,785 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-11-28 15:38:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:55,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-28 15:38:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:55,795 INFO L225 Difference]: With dead ends: 2219 [2019-11-28 15:38:55,795 INFO L226 Difference]: Without dead ends: 1481 [2019-11-28 15:38:55,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 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-28 15:38:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-11-28 15:38:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-11-28 15:38:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-11-28 15:38:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-11-28 15:38:55,875 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-11-28 15:38:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:55,875 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-11-28 15:38:55,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-11-28 15:38:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 15:38:55,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:55,880 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-28 15:38:56,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:56,086 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-11-28 15:38:56,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:56,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523036525] [2019-11-28 15:38:56,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-28 15:38:56,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523036525] [2019-11-28 15:38:56,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:56,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:56,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338624970] [2019-11-28 15:38:56,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:56,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:56,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:56,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:56,162 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-11-28 15:38:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:56,344 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-11-28 15:38:56,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:56,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-28 15:38:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:56,354 INFO L225 Difference]: With dead ends: 3059 [2019-11-28 15:38:56,355 INFO L226 Difference]: Without dead ends: 1585 [2019-11-28 15:38:56,358 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-28 15:38:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-28 15:38:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-11-28 15:38:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-11-28 15:38:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-11-28 15:38:56,416 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-11-28 15:38:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:56,416 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-11-28 15:38:56,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-11-28 15:38:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 15:38:56,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:56,422 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-28 15:38:56,422 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-11-28 15:38:56,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:56,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027801677] [2019-11-28 15:38:56,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:56,439 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:56,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470331815] [2019-11-28 15:38:56,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:56,524 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:56,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 15:38:56,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027801677] [2019-11-28 15:38:56,594 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:56,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470331815] [2019-11-28 15:38:56,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:56,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:56,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706879411] [2019-11-28 15:38:56,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:56,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:56,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:56,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:56,599 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-11-28 15:38:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:56,680 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-11-28 15:38:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:56,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-28 15:38:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:56,691 INFO L225 Difference]: With dead ends: 3139 [2019-11-28 15:38:56,691 INFO L226 Difference]: Without dead ends: 1964 [2019-11-28 15:38:56,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 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-28 15:38:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-11-28 15:38:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-11-28 15:38:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-11-28 15:38:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-11-28 15:38:56,799 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-11-28 15:38:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:56,800 INFO L462 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-11-28 15:38:56,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-11-28 15:38:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-28 15:38:56,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:56,806 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-11-28 15:38:57,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:57,011 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:57,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-11-28 15:38:57,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:57,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355011052] [2019-11-28 15:38:57,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:57,025 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:57,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141232926] [2019-11-28 15:38:57,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:57,114 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:38:57,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 15:38:57,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355011052] [2019-11-28 15:38:57,177 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:57,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141232926] [2019-11-28 15:38:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:57,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:57,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252654524] [2019-11-28 15:38:57,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:57,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:57,184 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-11-28 15:38:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:57,299 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-11-28 15:38:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:57,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-28 15:38:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:57,321 INFO L225 Difference]: With dead ends: 5743 [2019-11-28 15:38:57,321 INFO L226 Difference]: Without dead ends: 3786 [2019-11-28 15:38:57,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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-28 15:38:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-11-28 15:38:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-11-28 15:38:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:38:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-11-28 15:38:57,463 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-11-28 15:38:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:57,463 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-11-28 15:38:57,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-11-28 15:38:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-28 15:38:57,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:57,474 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-28 15:38:57,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:57,683 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:57,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-11-28 15:38:57,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:57,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866969097] [2019-11-28 15:38:57,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:57,699 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:57,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741180074] [2019-11-28 15:38:57,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:57,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:57,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-28 15:38:57,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866969097] [2019-11-28 15:38:57,840 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:57,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741180074] [2019-11-28 15:38:57,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:57,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:57,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099364116] [2019-11-28 15:38:57,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:57,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:57,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:57,842 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-11-28 15:38:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:58,099 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-11-28 15:38:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:58,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-28 15:38:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:58,118 INFO L225 Difference]: With dead ends: 7651 [2019-11-28 15:38:58,118 INFO L226 Difference]: Without dead ends: 3874 [2019-11-28 15:38:58,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 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-28 15:38:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-11-28 15:38:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-11-28 15:38:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:38:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-11-28 15:38:58,255 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-11-28 15:38:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:58,256 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-11-28 15:38:58,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-11-28 15:38:58,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-28 15:38:58,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:58,272 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-28 15:38:58,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:58,485 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-11-28 15:38:58,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:58,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385129777] [2019-11-28 15:38:58,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-28 15:38:58,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385129777] [2019-11-28 15:38:58,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:58,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:58,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219585735] [2019-11-28 15:38:58,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:58,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:58,615 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-11-28 15:38:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:58,873 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-11-28 15:38:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:58,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-28 15:38:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:58,894 INFO L225 Difference]: With dead ends: 7683 [2019-11-28 15:38:58,894 INFO L226 Difference]: Without dead ends: 3906 [2019-11-28 15:38:58,902 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-28 15:38:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-28 15:38:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-11-28 15:38:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:38:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-11-28 15:38:59,035 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-11-28 15:38:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:59,035 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-11-28 15:38:59,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-11-28 15:38:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-28 15:38:59,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:59,046 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-28 15:38:59,047 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:59,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-11-28 15:38:59,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:59,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104622311] [2019-11-28 15:38:59,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:59,064 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:59,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059884199] [2019-11-28 15:38:59,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:59,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:38:59,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-28 15:38:59,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104622311] [2019-11-28 15:38:59,216 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:59,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059884199] [2019-11-28 15:38:59,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:59,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:59,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388358818] [2019-11-28 15:38:59,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:59,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:59,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:59,218 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-11-28 15:38:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:59,441 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-11-28 15:38:59,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:59,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-28 15:38:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:59,458 INFO L225 Difference]: With dead ends: 7561 [2019-11-28 15:38:59,459 INFO L226 Difference]: Without dead ends: 3784 [2019-11-28 15:38:59,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 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-28 15:38:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-11-28 15:38:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-11-28 15:38:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-11-28 15:38:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-11-28 15:38:59,569 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-11-28 15:38:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:59,569 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-11-28 15:38:59,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-11-28 15:38:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-28 15:38:59,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:59,581 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-28 15:38:59,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:59,788 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:59,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-11-28 15:38:59,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:59,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004301996] [2019-11-28 15:38:59,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:59,804 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 15:38:59,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826319645] [2019-11-28 15:38:59,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:38:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:59,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:59,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-28 15:38:59,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004301996] [2019-11-28 15:38:59,987 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 15:38:59,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826319645] [2019-11-28 15:38:59,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:59,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:59,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587734468] [2019-11-28 15:38:59,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:59,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:59,989 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-11-28 15:39:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:00,240 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-11-28 15:39:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:00,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-28 15:39:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:00,260 INFO L225 Difference]: With dead ends: 7951 [2019-11-28 15:39:00,260 INFO L226 Difference]: Without dead ends: 2307 [2019-11-28 15:39:00,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 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-28 15:39:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-28 15:39:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-11-28 15:39:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-11-28 15:39:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-11-28 15:39:00,334 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-11-28 15:39:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:00,334 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-11-28 15:39:00,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-11-28 15:39:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-28 15:39:00,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:00,343 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-28 15:39:00,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:00,548 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:00,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-11-28 15:39:00,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:00,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550454261] [2019-11-28 15:39:00,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-11-28 15:39:00,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550454261] [2019-11-28 15:39:00,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:00,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:00,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050062538] [2019-11-28 15:39:00,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:00,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:00,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:00,692 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-11-28 15:39:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:00,864 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-11-28 15:39:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:00,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-11-28 15:39:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:00,870 INFO L225 Difference]: With dead ends: 4829 [2019-11-28 15:39:00,871 INFO L226 Difference]: Without dead ends: 2529 [2019-11-28 15:39:00,874 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-28 15:39:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-11-28 15:39:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-11-28 15:39:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-28 15:39:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-11-28 15:39:00,934 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-11-28 15:39:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:00,935 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-11-28 15:39:00,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-11-28 15:39:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-28 15:39:00,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:00,940 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-28 15:39:00,941 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-11-28 15:39:00,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:00,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476241668] [2019-11-28 15:39:00,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-28 15:39:01,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476241668] [2019-11-28 15:39:01,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:01,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:01,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695495759] [2019-11-28 15:39:01,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:01,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:01,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:01,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:01,072 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-11-28 15:39:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:01,248 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-11-28 15:39:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:01,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-11-28 15:39:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:01,254 INFO L225 Difference]: With dead ends: 4949 [2019-11-28 15:39:01,255 INFO L226 Difference]: Without dead ends: 2499 [2019-11-28 15:39:01,258 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-28 15:39:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-11-28 15:39:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-11-28 15:39:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-11-28 15:39:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-11-28 15:39:01,354 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-11-28 15:39:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:01,354 INFO L462 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-11-28 15:39:01,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-11-28 15:39:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-11-28 15:39:01,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:01,360 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-28 15:39:01,361 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-11-28 15:39:01,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:01,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586233950] [2019-11-28 15:39:01,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-28 15:39:01,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586233950] [2019-11-28 15:39:01,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842500277] [2019-11-28 15:39:01,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:01,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:39:01,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-28 15:39:01,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:39:01,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:39:01,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430294018] [2019-11-28 15:39:01,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:01,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:01,791 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-11-28 15:39:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:02,181 INFO L93 Difference]: Finished difference Result 6557 states and 9123 transitions. [2019-11-28 15:39:02,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:02,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-11-28 15:39:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:02,190 INFO L225 Difference]: With dead ends: 6557 [2019-11-28 15:39:02,190 INFO L226 Difference]: Without dead ends: 3975 [2019-11-28 15:39:02,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 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-28 15:39:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-11-28 15:39:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2534. [2019-11-28 15:39:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-28 15:39:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-11-28 15:39:02,265 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-11-28 15:39:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:02,266 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-11-28 15:39:02,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-11-28 15:39:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-11-28 15:39:02,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:02,272 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:02,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:02,485 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:02,485 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-11-28 15:39:02,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:02,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835836795] [2019-11-28 15:39:02,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-11-28 15:39:02,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835836795] [2019-11-28 15:39:02,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:02,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:02,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893133770] [2019-11-28 15:39:02,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:02,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:02,733 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-11-28 15:39:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:02,927 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-11-28 15:39:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:02,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-11-28 15:39:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:02,934 INFO L225 Difference]: With dead ends: 5073 [2019-11-28 15:39:02,935 INFO L226 Difference]: Without dead ends: 2546 [2019-11-28 15:39:02,938 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-28 15:39:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-11-28 15:39:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-11-28 15:39:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-11-28 15:39:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-11-28 15:39:03,010 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-11-28 15:39:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:03,010 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-11-28 15:39:03,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-11-28 15:39:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-11-28 15:39:03,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:03,017 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:03,018 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-11-28 15:39:03,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:03,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581643209] [2019-11-28 15:39:03,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-28 15:39:03,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581643209] [2019-11-28 15:39:03,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:03,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:03,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53637115] [2019-11-28 15:39:03,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:03,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:03,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:03,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:03,224 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-11-28 15:39:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:03,410 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-11-28 15:39:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:03,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-11-28 15:39:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:03,416 INFO L225 Difference]: With dead ends: 5277 [2019-11-28 15:39:03,416 INFO L226 Difference]: Without dead ends: 2750 [2019-11-28 15:39:03,421 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-28 15:39:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-11-28 15:39:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-11-28 15:39:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-11-28 15:39:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-11-28 15:39:03,482 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-11-28 15:39:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:03,482 INFO L462 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-11-28 15:39:03,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-11-28 15:39:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-11-28 15:39:03,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:03,489 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:03,489 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:03,489 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-11-28 15:39:03,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:03,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305244139] [2019-11-28 15:39:03,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-11-28 15:39:03,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305244139] [2019-11-28 15:39:03,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:03,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:03,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443134038] [2019-11-28 15:39:03,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:03,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:03,726 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-11-28 15:39:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:03,908 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-11-28 15:39:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:03,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-11-28 15:39:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:03,914 INFO L225 Difference]: With dead ends: 5697 [2019-11-28 15:39:03,915 INFO L226 Difference]: Without dead ends: 2966 [2019-11-28 15:39:03,919 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-28 15:39:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-11-28 15:39:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-11-28 15:39:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-11-28 15:39:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-11-28 15:39:03,982 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-11-28 15:39:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:03,983 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-11-28 15:39:03,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-11-28 15:39:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-28 15:39:03,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:03,990 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:03,991 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-11-28 15:39:03,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:03,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83669515] [2019-11-28 15:39:03,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-28 15:39:04,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83669515] [2019-11-28 15:39:04,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580416901] [2019-11-28 15:39:04,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:04,371 INFO L264 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:39:04,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-28 15:39:04,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:39:04,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:39:04,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104643124] [2019-11-28 15:39:04,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:04,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:04,600 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-11-28 15:39:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:04,792 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-11-28 15:39:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:04,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-11-28 15:39:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:04,794 INFO L225 Difference]: With dead ends: 4704 [2019-11-28 15:39:04,794 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:39:04,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 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-28 15:39:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:39:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:39:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:39:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:39:04,800 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-11-28 15:39:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:04,800 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:39:04,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:39:04,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:39:05,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:05,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:39:05,719 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-28 15:39:05,913 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 80 [2019-11-28 15:39:06,174 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-28 15:39:06,307 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-11-28 15:39:06,545 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-28 15:39:06,716 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-28 15:39:06,897 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-28 15:39:07,067 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-28 15:39:07,250 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-28 15:39:07,509 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-28 15:39:07,708 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-28 15:39:07,919 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-28 15:39:08,095 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-28 15:39:08,326 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-28 15:39:08,570 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-28 15:39:08,713 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-28 15:39:08,965 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-11-28 15:39:09,155 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-28 15:39:09,458 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-11-28 15:39:09,605 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-28 15:39:09,763 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-28 15:39:09,767 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-11-28 15:39:09,767 INFO L246 CegarLoopResult]: For program point L201(lines 201 591) no Hoare annotation was computed. [2019-11-28 15:39:09,767 INFO L246 CegarLoopResult]: For program point L168(lines 168 602) no Hoare annotation was computed. [2019-11-28 15:39:09,767 INFO L246 CegarLoopResult]: For program point L135(lines 135 613) no Hoare annotation was computed. [2019-11-28 15:39:09,767 INFO L246 CegarLoopResult]: For program point L102(lines 102 624) no Hoare annotation was computed. [2019-11-28 15:39:09,767 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-11-28 15:39:09,767 INFO L242 CegarLoopResult]: At program point L202(lines 198 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-11-28 15:39:09,768 INFO L242 CegarLoopResult]: At program point L103(lines 102 624) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-11-28 15:39:09,768 INFO L246 CegarLoopResult]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-11-28 15:39:09,768 INFO L246 CegarLoopResult]: For program point L500-2(lines 209 586) no Hoare annotation was computed. [2019-11-28 15:39:09,768 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-11-28 15:39:09,768 INFO L246 CegarLoopResult]: For program point L204(lines 204 590) no Hoare annotation was computed. [2019-11-28 15:39:09,768 INFO L246 CegarLoopResult]: For program point L171(lines 171 601) no Hoare annotation was computed. [2019-11-28 15:39:09,768 INFO L246 CegarLoopResult]: For program point L138(lines 138 612) no Hoare annotation was computed. [2019-11-28 15:39:09,768 INFO L246 CegarLoopResult]: For program point L105(lines 105 623) no Hoare annotation was computed. [2019-11-28 15:39:09,769 INFO L242 CegarLoopResult]: At program point L205(lines 204 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-28 15:39:09,769 INFO L242 CegarLoopResult]: At program point L172(lines 168 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,770 INFO L242 CegarLoopResult]: At program point L139(lines 135 613) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6 .cse1))) [2019-11-28 15:39:09,770 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-28 15:39:09,770 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-11-28 15:39:09,771 INFO L246 CegarLoopResult]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-11-28 15:39:09,771 INFO L246 CegarLoopResult]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-11-28 15:39:09,771 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-28 15:39:09,771 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 586) no Hoare annotation was computed. [2019-11-28 15:39:09,771 INFO L246 CegarLoopResult]: For program point L174(lines 174 600) no Hoare annotation was computed. [2019-11-28 15:39:09,771 INFO L246 CegarLoopResult]: For program point L141(lines 141 611) no Hoare annotation was computed. [2019-11-28 15:39:09,773 INFO L246 CegarLoopResult]: For program point L108(lines 108 622) no Hoare annotation was computed. [2019-11-28 15:39:09,773 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-11-28 15:39:09,773 INFO L242 CegarLoopResult]: At program point L208(lines 207 589) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2019-11-28 15:39:09,773 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-28 15:39:09,773 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-28 15:39:09,773 INFO L249 CegarLoopResult]: At program point L671(lines 64 673) the Hoare annotation is: true [2019-11-28 15:39:09,773 INFO L246 CegarLoopResult]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-11-28 15:39:09,773 INFO L246 CegarLoopResult]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-28 15:39:09,774 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-28 15:39:09,774 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-11-28 15:39:09,774 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 586) no Hoare annotation was computed. [2019-11-28 15:39:09,774 INFO L249 CegarLoopResult]: At program point L672(lines 9 674) the Hoare annotation is: true [2019-11-28 15:39:09,774 INFO L246 CegarLoopResult]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-11-28 15:39:09,774 INFO L246 CegarLoopResult]: For program point L177(lines 177 599) no Hoare annotation was computed. [2019-11-28 15:39:09,774 INFO L246 CegarLoopResult]: For program point L144(lines 144 610) no Hoare annotation was computed. [2019-11-28 15:39:09,774 INFO L246 CegarLoopResult]: For program point L111(lines 111 621) no Hoare annotation was computed. [2019-11-28 15:39:09,775 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-11-28 15:39:09,775 INFO L242 CegarLoopResult]: At program point L178(lines 174 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,775 INFO L242 CegarLoopResult]: At program point L145(lines 141 611) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:09,775 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-28 15:39:09,775 INFO L242 CegarLoopResult]: At program point L212(lines 105 623) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:09,775 INFO L246 CegarLoopResult]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L180(lines 180 598) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L147(lines 147 609) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L114(lines 114 620) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 673) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L183(lines 183 597) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L150(lines 150 608) no Hoare annotation was computed. [2019-11-28 15:39:09,776 INFO L246 CegarLoopResult]: For program point L117(lines 117 619) no Hoare annotation was computed. [2019-11-28 15:39:09,777 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-28 15:39:09,777 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-11-28 15:39:09,777 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-11-28 15:39:09,777 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-11-28 15:39:09,777 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-11-28 15:39:09,777 INFO L242 CegarLoopResult]: At program point L184(lines 180 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,777 INFO L242 CegarLoopResult]: At program point L151(lines 147 609) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 586) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point L186(lines 186 596) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point L153(lines 153 607) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point L120(lines 120 618) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L242 CegarLoopResult]: At program point L550(lines 64 673) the Hoare annotation is: false [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-11-28 15:39:09,778 INFO L242 CegarLoopResult]: At program point L121(lines 117 619) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse3 .cse4 .cse5 .cse0 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1))) [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L249 CegarLoopResult]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L189(lines 189 595) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L156(lines 156 606) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L123(lines 123 617) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-11-28 15:39:09,779 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-11-28 15:39:09,780 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:39:09,780 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 586) no Hoare annotation was computed. [2019-11-28 15:39:09,780 INFO L242 CegarLoopResult]: At program point L190(lines 186 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-11-28 15:39:09,780 INFO L242 CegarLoopResult]: At program point L157(lines 153 607) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-28 15:39:09,780 INFO L242 CegarLoopResult]: At program point L124(lines 123 617) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-11-28 15:39:09,781 INFO L242 CegarLoopResult]: At program point L587(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L192(lines 192 594) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L159(lines 159 605) no Hoare annotation was computed. [2019-11-28 15:39:09,781 INFO L246 CegarLoopResult]: For program point L126(lines 126 616) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L249 CegarLoopResult]: At program point L656(lines 98 657) the Hoare annotation is: true [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point L195(lines 195 593) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point L162(lines 162 604) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point L129(lines 129 615) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-11-28 15:39:09,782 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-11-28 15:39:09,783 INFO L242 CegarLoopResult]: At program point L196(lines 192 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse5 .cse7 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,783 INFO L242 CegarLoopResult]: At program point L163(lines 159 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse11) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,783 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 586) no Hoare annotation was computed. [2019-11-28 15:39:09,783 INFO L246 CegarLoopResult]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-11-28 15:39:09,783 INFO L246 CegarLoopResult]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-11-28 15:39:09,783 INFO L246 CegarLoopResult]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-28 15:39:09,783 INFO L246 CegarLoopResult]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-11-28 15:39:09,783 INFO L246 CegarLoopResult]: For program point L527-2(lines 209 586) no Hoare annotation was computed. [2019-11-28 15:39:09,783 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-28 15:39:09,784 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:09,784 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-11-28 15:39:09,785 INFO L246 CegarLoopResult]: For program point L198(lines 198 592) no Hoare annotation was computed. [2019-11-28 15:39:09,785 INFO L246 CegarLoopResult]: For program point L165(lines 165 603) no Hoare annotation was computed. [2019-11-28 15:39:09,785 INFO L246 CegarLoopResult]: For program point L132(lines 132 614) no Hoare annotation was computed. [2019-11-28 15:39:09,785 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse0 .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse3 .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not .cse2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,785 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-11-28 15:39:09,785 INFO L242 CegarLoopResult]: At program point L166(lines 165 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1) (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-11-28 15:39:09,785 INFO L242 CegarLoopResult]: At program point L133(lines 126 616) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse2 .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8 .cse1))) [2019-11-28 15:39:09,786 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 15:39:09,786 INFO L246 CegarLoopResult]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-11-28 15:39:09,786 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-11-28 15:39:09,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:39:09 BoogieIcfgContainer [2019-11-28 15:39:09,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:39:09,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:39:09,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:39:09,824 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:39:09,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:50" (3/4) ... [2019-11-28 15:39:09,828 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:39:09,848 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:39:09,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:39:09,946 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:39:09,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:39:09,948 INFO L168 Benchmark]: Toolchain (without parser) took 21291.35 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 878.2 MB). Free memory was 955.0 MB in the beginning and 1.4 GB in the end (delta: -475.3 MB). Peak memory consumption was 402.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:09,948 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:09,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:09,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:09,949 INFO L168 Benchmark]: Boogie Preprocessor took 44.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:09,950 INFO L168 Benchmark]: RCFGBuilder took 902.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:09,950 INFO L168 Benchmark]: TraceAbstraction took 19625.22 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 736.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -379.2 MB). Peak memory consumption was 813.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:09,950 INFO L168 Benchmark]: Witness Printer took 122.93 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:09,952 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 902.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19625.22 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 736.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -379.2 MB). Peak memory consumption was 813.3 MB. Max. memory is 11.5 GB. * Witness Printer took 122.93 ms. Allocated memory is still 1.9 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8448)) || ((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 3 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 8672)) && !(0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8480)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8560)) && s__state <= 8576) && !(s__state == 8480)) && !(s__state == 8545)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((s__state <= 3 || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && s__state == 8448)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8657)) && !(s__state == 8497)) && !(s__state == 8480)) && !(s__state == 8545))) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8480)) || ((((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 12292)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8656)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(0 == s__hit)) || (((((((((blastFlag <= 2 && !(s__state == 8561)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8544)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8545)) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8672)) && !(s__state == 8497)) && !(s__state == 8560)) && !(s__state == 8496)) && !(s__state == 8480)) && !(s__state == 8545)) || ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(s__state == 8672)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8496)) && !(s__state == 8480)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Result: SAFE, OverallTime: 14.7s, OverallIterations: 31, TraceHistogramMax: 19, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 5245 SDtfs, 3316 SDslu, 2433 SDs, 0 SdLazy, 2970 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 1865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1906 HoareAnnotationTreeSize, 29 FomulaSimplifications, 40806 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6404 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...