./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.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 a8546eefa2f2d2c21cb36b9121195492b8a27fd6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:35:25,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:35:25,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:35:25,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:35:25,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:35:25,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:35:25,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:35:25,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:35:25,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:35:25,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:35:25,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:35:25,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:35:25,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:35:25,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:35:25,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:35:25,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:35:25,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:35:25,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:35:25,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:35:25,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:35:25,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:35:25,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:35:25,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:35:25,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:35:25,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:35:25,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:35:25,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:35:25,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:35:25,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:35:25,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:35:25,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:35:25,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:35:25,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:35:25,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:35:25,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:35:25,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:35:25,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:35:25,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:35:25,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:35:25,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:35:25,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:35:25,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:35:25,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:35:25,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:35:25,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:35:25,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:35:25,894 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:35:25,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:35:25,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:35:25,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:35:25,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:35:25,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:35:25,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:35:25,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:35:25,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:35:25,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:35:25,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:35:25,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:35:25,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:35:25,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:35:25,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:35:25,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:35:25,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:35:25,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:25,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:35:25,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:35:25,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:35:25,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:35:25,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:35:25,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:35:25,901 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 -> a8546eefa2f2d2c21cb36b9121195492b8a27fd6 [2019-11-27 22:35:26,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:35:26,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:35:26,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:35:26,221 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:35:26,221 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:35:26,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-27 22:35:26,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcc5efb3/ecc9534769fc42b1bc255502134a0e5b/FLAG522de7d4f [2019-11-27 22:35:26,760 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:35:26,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-27 22:35:26,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcc5efb3/ecc9534769fc42b1bc255502134a0e5b/FLAG522de7d4f [2019-11-27 22:35:27,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcc5efb3/ecc9534769fc42b1bc255502134a0e5b [2019-11-27 22:35:27,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:35:27,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:35:27,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:27,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:35:27,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:35:27,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc447bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27, skipping insertion in model container [2019-11-27 22:35:27,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:35:27,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:35:27,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:27,515 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:35:27,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:35:27,644 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:35:27,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27 WrapperNode [2019-11-27 22:35:27,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:35:27,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:27,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:35:27,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:35:27,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:35:27,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:35:27,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:35:27,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:35:27,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... [2019-11-27 22:35:27,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:35:27,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:35:27,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:35:27,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:35:27,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:35:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:35:27,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:35:27,944 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:35:28,527 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-27 22:35:28,528 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-27 22:35:28,531 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:35:28,531 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:35:28,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:28 BoogieIcfgContainer [2019-11-27 22:35:28,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:35:28,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:35:28,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:35:28,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:35:28,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:35:27" (1/3) ... [2019-11-27 22:35:28,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d26bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:28, skipping insertion in model container [2019-11-27 22:35:28,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:35:27" (2/3) ... [2019-11-27 22:35:28,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d26bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:35:28, skipping insertion in model container [2019-11-27 22:35:28,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:28" (3/3) ... [2019-11-27 22:35:28,541 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-11-27 22:35:28,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:35:28,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:35:28,569 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:35:28,594 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:35:28,594 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:35:28,594 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:35:28,594 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:35:28,595 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:35:28,595 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:35:28,595 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:35:28,595 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:35:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-27 22:35:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:35:28,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:28,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:28,621 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-27 22:35:28,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:28,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141167988] [2019-11-27 22:35:28,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:28,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141167988] [2019-11-27 22:35:28,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:28,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:35:28,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354960207] [2019-11-27 22:35:28,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:28,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:28,856 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-27 22:35:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:29,062 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-27 22:35:29,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:29,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:35:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:29,078 INFO L225 Difference]: With dead ends: 249 [2019-11-27 22:35:29,078 INFO L226 Difference]: Without dead ends: 113 [2019-11-27 22:35:29,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-27 22:35:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-27 22:35:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-27 22:35:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-27 22:35:29,131 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-27 22:35:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:29,132 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-27 22:35:29,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-27 22:35:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:35:29,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:29,135 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:35:29,135 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-27 22:35:29,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:29,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108748864] [2019-11-27 22:35:29,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:35:29,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108748864] [2019-11-27 22:35:29,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:29,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:29,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148154543] [2019-11-27 22:35:29,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:29,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:29,247 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-27 22:35:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:29,401 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-27 22:35:29,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:29,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:35:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:29,404 INFO L225 Difference]: With dead ends: 235 [2019-11-27 22:35:29,404 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 22:35:29,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 22:35:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-27 22:35:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-27 22:35:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-27 22:35:29,419 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-27 22:35:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:29,420 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-27 22:35:29,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-27 22:35:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:35:29,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:29,426 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-27 22:35:29,426 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-27 22:35:29,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:29,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893478361] [2019-11-27 22:35:29,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:35:29,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893478361] [2019-11-27 22:35:29,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:29,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:29,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751742480] [2019-11-27 22:35:29,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:29,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:29,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:29,527 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-27 22:35:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:29,679 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-27 22:35:29,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:29,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:35:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:29,682 INFO L225 Difference]: With dead ends: 268 [2019-11-27 22:35:29,683 INFO L226 Difference]: Without dead ends: 149 [2019-11-27 22:35:29,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-27 22:35:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-27 22:35:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-27 22:35:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-27 22:35:29,696 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-27 22:35:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:29,696 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-27 22:35:29,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-27 22:35:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:29,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:29,699 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2019-11-27 22:35:29,699 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-27 22:35:29,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:29,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178873816] [2019-11-27 22:35:29,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:29,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178873816] [2019-11-27 22:35:29,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:29,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:29,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107857788] [2019-11-27 22:35:29,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:29,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:29,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:29,806 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-27 22:35:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:30,000 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-27 22:35:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:30,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:30,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:30,004 INFO L225 Difference]: With dead ends: 332 [2019-11-27 22:35:30,007 INFO L226 Difference]: Without dead ends: 195 [2019-11-27 22:35:30,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-27 22:35:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-27 22:35:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-27 22:35:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-27 22:35:30,038 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-27 22:35:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:30,038 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-27 22:35:30,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-27 22:35:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:35:30,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:30,043 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2019-11-27 22:35:30,043 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-27 22:35:30,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:30,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309182297] [2019-11-27 22:35:30,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:35:30,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309182297] [2019-11-27 22:35:30,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:30,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:30,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050160199] [2019-11-27 22:35:30,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:30,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:30,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:30,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,130 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-27 22:35:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:30,268 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-27 22:35:30,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:30,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:35:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:30,271 INFO L225 Difference]: With dead ends: 386 [2019-11-27 22:35:30,271 INFO L226 Difference]: Without dead ends: 209 [2019-11-27 22:35:30,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-27 22:35:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-27 22:35:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-27 22:35:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-27 22:35:30,282 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-27 22:35:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:30,283 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-27 22:35:30,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-27 22:35:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-27 22:35:30,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:30,285 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:30,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-27 22:35:30,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:30,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617661023] [2019-11-27 22:35:30,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:35:30,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617661023] [2019-11-27 22:35:30,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:30,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:30,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029550906] [2019-11-27 22:35:30,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:30,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,370 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-27 22:35:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:30,512 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-27 22:35:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:30,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-27 22:35:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:30,516 INFO L225 Difference]: With dead ends: 425 [2019-11-27 22:35:30,516 INFO L226 Difference]: Without dead ends: 229 [2019-11-27 22:35:30,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-27 22:35:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-27 22:35:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-27 22:35:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-27 22:35:30,528 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-27 22:35:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:30,530 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-27 22:35:30,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-27 22:35:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-27 22:35:30,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:30,538 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:30,538 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-27 22:35:30,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:30,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940069090] [2019-11-27 22:35:30,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:35:30,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940069090] [2019-11-27 22:35:30,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:30,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:30,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815991390] [2019-11-27 22:35:30,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:30,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,660 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-27 22:35:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:30,704 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-27 22:35:30,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:30,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-27 22:35:30,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:30,708 INFO L225 Difference]: With dead ends: 658 [2019-11-27 22:35:30,709 INFO L226 Difference]: Without dead ends: 441 [2019-11-27 22:35:30,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-27 22:35:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-27 22:35:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-27 22:35:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-27 22:35:30,738 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-27 22:35:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:30,738 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-27 22:35:30,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-27 22:35:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:35:30,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:30,740 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:30,741 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-27 22:35:30,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:30,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44687460] [2019-11-27 22:35:30,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:35:30,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44687460] [2019-11-27 22:35:30,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:30,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:30,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529888485] [2019-11-27 22:35:30,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:30,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:30,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,822 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2019-11-27 22:35:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:30,858 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2019-11-27 22:35:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:30,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:35:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:30,863 INFO L225 Difference]: With dead ends: 658 [2019-11-27 22:35:30,863 INFO L226 Difference]: Without dead ends: 656 [2019-11-27 22:35:30,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-27 22:35:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-27 22:35:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-27 22:35:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-27 22:35:30,884 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2019-11-27 22:35:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:30,885 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-27 22:35:30,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-27 22:35:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-27 22:35:30,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:30,887 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:30,888 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2019-11-27 22:35:30,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:30,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709012770] [2019-11-27 22:35:30,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-27 22:35:30,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709012770] [2019-11-27 22:35:30,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:30,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:30,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400576656] [2019-11-27 22:35:30,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:30,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:30,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:30,966 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-27 22:35:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:31,111 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2019-11-27 22:35:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:31,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-27 22:35:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:31,116 INFO L225 Difference]: With dead ends: 1383 [2019-11-27 22:35:31,116 INFO L226 Difference]: Without dead ends: 736 [2019-11-27 22:35:31,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-27 22:35:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2019-11-27 22:35:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-11-27 22:35:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2019-11-27 22:35:31,143 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2019-11-27 22:35:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:31,144 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2019-11-27 22:35:31,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2019-11-27 22:35:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-27 22:35:31,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:31,146 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:31,147 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2019-11-27 22:35:31,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:31,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861794362] [2019-11-27 22:35:31,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-27 22:35:31,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861794362] [2019-11-27 22:35:31,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:31,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:31,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280010059] [2019-11-27 22:35:31,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:31,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:31,206 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2019-11-27 22:35:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:31,382 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2019-11-27 22:35:31,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:31,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-27 22:35:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:31,388 INFO L225 Difference]: With dead ends: 1594 [2019-11-27 22:35:31,388 INFO L226 Difference]: Without dead ends: 875 [2019-11-27 22:35:31,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-11-27 22:35:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2019-11-27 22:35:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-27 22:35:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2019-11-27 22:35:31,411 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2019-11-27 22:35:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:31,412 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2019-11-27 22:35:31,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2019-11-27 22:35:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-27 22:35:31,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:31,416 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:31,417 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:31,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:31,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2019-11-27 22:35:31,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:31,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414208944] [2019-11-27 22:35:31,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-27 22:35:31,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414208944] [2019-11-27 22:35:31,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:31,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:31,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704766440] [2019-11-27 22:35:31,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:31,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:31,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:31,498 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2019-11-27 22:35:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:31,622 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2019-11-27 22:35:31,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:31,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-27 22:35:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:31,627 INFO L225 Difference]: With dead ends: 1765 [2019-11-27 22:35:31,628 INFO L226 Difference]: Without dead ends: 932 [2019-11-27 22:35:31,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-11-27 22:35:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2019-11-27 22:35:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-27 22:35:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2019-11-27 22:35:31,650 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2019-11-27 22:35:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:31,651 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2019-11-27 22:35:31,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2019-11-27 22:35:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-27 22:35:31,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:31,655 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:31,655 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:31,656 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2019-11-27 22:35:31,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:31,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186577757] [2019-11-27 22:35:31,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-11-27 22:35:31,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186577757] [2019-11-27 22:35:31,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:31,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:31,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172772804] [2019-11-27 22:35:31,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:31,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:31,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:31,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:31,744 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2019-11-27 22:35:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:31,882 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2019-11-27 22:35:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:31,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-27 22:35:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:31,888 INFO L225 Difference]: With dead ends: 1945 [2019-11-27 22:35:31,889 INFO L226 Difference]: Without dead ends: 1028 [2019-11-27 22:35:31,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-27 22:35:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-11-27 22:35:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-27 22:35:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2019-11-27 22:35:31,924 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2019-11-27 22:35:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:31,924 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2019-11-27 22:35:31,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2019-11-27 22:35:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-27 22:35:31,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:31,929 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:31,929 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2019-11-27 22:35:31,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:31,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322812485] [2019-11-27 22:35:31,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-27 22:35:32,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322812485] [2019-11-27 22:35:32,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:32,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:32,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462048453] [2019-11-27 22:35:32,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:32,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:32,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:32,070 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2019-11-27 22:35:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:32,108 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2019-11-27 22:35:32,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:32,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-27 22:35:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:32,118 INFO L225 Difference]: With dead ends: 3036 [2019-11-27 22:35:32,118 INFO L226 Difference]: Without dead ends: 2026 [2019-11-27 22:35:32,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-11-27 22:35:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2019-11-27 22:35:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-11-27 22:35:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2019-11-27 22:35:32,165 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2019-11-27 22:35:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:32,166 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2019-11-27 22:35:32,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2019-11-27 22:35:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-27 22:35:32,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:32,171 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:32,172 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2019-11-27 22:35:32,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:32,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300462131] [2019-11-27 22:35:32,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-27 22:35:32,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300462131] [2019-11-27 22:35:32,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:32,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:32,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023345423] [2019-11-27 22:35:32,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:32,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:32,255 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2019-11-27 22:35:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:32,397 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2019-11-27 22:35:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:32,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-27 22:35:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:32,408 INFO L225 Difference]: With dead ends: 4264 [2019-11-27 22:35:32,408 INFO L226 Difference]: Without dead ends: 2249 [2019-11-27 22:35:32,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-27 22:35:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2019-11-27 22:35:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-11-27 22:35:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2019-11-27 22:35:32,459 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2019-11-27 22:35:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:32,460 INFO L462 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2019-11-27 22:35:32,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2019-11-27 22:35:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-27 22:35:32,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:32,466 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:32,466 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2019-11-27 22:35:32,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:32,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541236685] [2019-11-27 22:35:32,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-27 22:35:32,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541236685] [2019-11-27 22:35:32,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:32,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:32,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926982826] [2019-11-27 22:35:32,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:32,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:32,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:32,555 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2019-11-27 22:35:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:32,695 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2019-11-27 22:35:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:32,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-27 22:35:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:32,706 INFO L225 Difference]: With dead ends: 4576 [2019-11-27 22:35:32,706 INFO L226 Difference]: Without dead ends: 2348 [2019-11-27 22:35:32,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-11-27 22:35:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2019-11-27 22:35:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-11-27 22:35:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2019-11-27 22:35:32,768 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2019-11-27 22:35:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:32,769 INFO L462 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2019-11-27 22:35:32,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2019-11-27 22:35:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-27 22:35:32,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:32,776 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:32,776 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2019-11-27 22:35:32,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:32,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192663334] [2019-11-27 22:35:32,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:35:32,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192663334] [2019-11-27 22:35:32,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:32,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:32,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274701165] [2019-11-27 22:35:32,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:32,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:32,870 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2019-11-27 22:35:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:33,054 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2019-11-27 22:35:33,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:33,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-27 22:35:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:33,067 INFO L225 Difference]: With dead ends: 4963 [2019-11-27 22:35:33,068 INFO L226 Difference]: Without dead ends: 2636 [2019-11-27 22:35:33,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-27 22:35:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2019-11-27 22:35:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-11-27 22:35:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2019-11-27 22:35:33,152 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2019-11-27 22:35:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:33,152 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2019-11-27 22:35:33,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2019-11-27 22:35:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-27 22:35:33,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:33,162 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:33,163 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2019-11-27 22:35:33,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:33,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280527786] [2019-11-27 22:35:33,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:35:33,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280527786] [2019-11-27 22:35:33,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609944001] [2019-11-27 22:35:33,335 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-27 22:35:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:33,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:33,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-27 22:35:33,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:33,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:33,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662788332] [2019-11-27 22:35:33,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:33,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:33,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:33,560 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2019-11-27 22:35:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:33,968 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2019-11-27 22:35:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:35:33,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-27 22:35:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:33,993 INFO L225 Difference]: With dead ends: 8082 [2019-11-27 22:35:33,993 INFO L226 Difference]: Without dead ends: 5509 [2019-11-27 22:35:33,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-11-27 22:35:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2019-11-27 22:35:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-11-27 22:35:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2019-11-27 22:35:34,116 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2019-11-27 22:35:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:34,116 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2019-11-27 22:35:34,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2019-11-27 22:35:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-27 22:35:34,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:34,128 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:34,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:34,333 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:34,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2019-11-27 22:35:34,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:34,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641529298] [2019-11-27 22:35:34,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-27 22:35:34,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641529298] [2019-11-27 22:35:34,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:34,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:34,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16066742] [2019-11-27 22:35:34,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:34,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:34,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:34,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:34,541 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2019-11-27 22:35:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:34,636 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2019-11-27 22:35:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:34,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-27 22:35:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:34,669 INFO L225 Difference]: With dead ends: 12402 [2019-11-27 22:35:34,669 INFO L226 Difference]: Without dead ends: 7294 [2019-11-27 22:35:34,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-11-27 22:35:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2019-11-27 22:35:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-11-27 22:35:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2019-11-27 22:35:34,868 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2019-11-27 22:35:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:34,869 INFO L462 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2019-11-27 22:35:34,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2019-11-27 22:35:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-27 22:35:34,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:34,890 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:34,890 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2019-11-27 22:35:34,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:34,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244656883] [2019-11-27 22:35:34,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-11-27 22:35:35,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244656883] [2019-11-27 22:35:35,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326637329] [2019-11-27 22:35:35,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,055 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2019-11-27 22:35:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:35,345 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2019-11-27 22:35:35,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:35,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-11-27 22:35:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:35,362 INFO L225 Difference]: With dead ends: 14569 [2019-11-27 22:35:35,362 INFO L226 Difference]: Without dead ends: 7286 [2019-11-27 22:35:35,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-11-27 22:35:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2019-11-27 22:35:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2019-11-27 22:35:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2019-11-27 22:35:35,590 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2019-11-27 22:35:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:35,591 INFO L462 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2019-11-27 22:35:35,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2019-11-27 22:35:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-27 22:35:35,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:35,613 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 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-27 22:35:35,613 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2019-11-27 22:35:35,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:35,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136556687] [2019-11-27 22:35:35,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:35,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136556687] [2019-11-27 22:35:35,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:35,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:35,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916126564] [2019-11-27 22:35:35,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:35,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:35,807 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2019-11-27 22:35:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:36,145 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2019-11-27 22:35:36,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:36,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-11-27 22:35:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:36,166 INFO L225 Difference]: With dead ends: 13675 [2019-11-27 22:35:36,167 INFO L226 Difference]: Without dead ends: 7415 [2019-11-27 22:35:36,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-11-27 22:35:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2019-11-27 22:35:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2019-11-27 22:35:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2019-11-27 22:35:36,367 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2019-11-27 22:35:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:36,368 INFO L462 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2019-11-27 22:35:36,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2019-11-27 22:35:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-27 22:35:36,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:36,385 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1] [2019-11-27 22:35:36,385 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:36,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2019-11-27 22:35:36,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:36,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836435287] [2019-11-27 22:35:36,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:36,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836435287] [2019-11-27 22:35:36,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620624755] [2019-11-27 22:35:36,737 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-27 22:35:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:36,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:36,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-11-27 22:35:37,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:35:37,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 22:35:37,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265392663] [2019-11-27 22:35:37,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:37,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:37,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:37,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:37,177 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 3 states. [2019-11-27 22:35:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:37,324 INFO L93 Difference]: Finished difference Result 15401 states and 19915 transitions. [2019-11-27 22:35:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:37,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-11-27 22:35:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:37,352 INFO L225 Difference]: With dead ends: 15401 [2019-11-27 22:35:37,352 INFO L226 Difference]: Without dead ends: 8799 [2019-11-27 22:35:37,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-11-27 22:35:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 8799. [2019-11-27 22:35:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8799 states. [2019-11-27 22:35:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8799 states to 8799 states and 11356 transitions. [2019-11-27 22:35:37,644 INFO L78 Accepts]: Start accepts. Automaton has 8799 states and 11356 transitions. Word has length 371 [2019-11-27 22:35:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:37,645 INFO L462 AbstractCegarLoop]: Abstraction has 8799 states and 11356 transitions. [2019-11-27 22:35:37,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8799 states and 11356 transitions. [2019-11-27 22:35:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-27 22:35:37,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:37,675 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 1] [2019-11-27 22:35:37,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:37,889 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash -106230564, now seen corresponding path program 1 times [2019-11-27 22:35:37,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:37,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705394071] [2019-11-27 22:35:37,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:38,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705394071] [2019-11-27 22:35:38,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360499259] [2019-11-27 22:35:38,095 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-27 22:35:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:38,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:38,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-27 22:35:38,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:38,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:38,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929646101] [2019-11-27 22:35:38,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:38,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:38,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:38,338 INFO L87 Difference]: Start difference. First operand 8799 states and 11356 transitions. Second operand 4 states. [2019-11-27 22:35:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:38,731 INFO L93 Difference]: Finished difference Result 19741 states and 25400 transitions. [2019-11-27 22:35:38,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:38,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-27 22:35:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:38,755 INFO L225 Difference]: With dead ends: 19741 [2019-11-27 22:35:38,755 INFO L226 Difference]: Without dead ends: 10934 [2019-11-27 22:35:38,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-11-27 22:35:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2019-11-27 22:35:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-11-27 22:35:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2019-11-27 22:35:38,981 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 373 [2019-11-27 22:35:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:38,982 INFO L462 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2019-11-27 22:35:38,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2019-11-27 22:35:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-27 22:35:39,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,005 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:39,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:39,217 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,218 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2019-11-27 22:35:39,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524228041] [2019-11-27 22:35:39,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-27 22:35:39,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524228041] [2019-11-27 22:35:39,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:35:39,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:35:39,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735499590] [2019-11-27 22:35:39,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:35:39,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:39,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:35:39,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,390 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2019-11-27 22:35:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:39,668 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2019-11-27 22:35:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:35:39,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-27 22:35:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:39,677 INFO L225 Difference]: With dead ends: 18222 [2019-11-27 22:35:39,678 INFO L226 Difference]: Without dead ends: 3798 [2019-11-27 22:35:39,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:35:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-11-27 22:35:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2019-11-27 22:35:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-11-27 22:35:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2019-11-27 22:35:39,788 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2019-11-27 22:35:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:39,789 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2019-11-27 22:35:39,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:35:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2019-11-27 22:35:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-27 22:35:39,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:35:39,804 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:35:39,804 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:35:39,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:35:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2019-11-27 22:35:39,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:35:39,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643446423] [2019-11-27 22:35:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:35:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-27 22:35:40,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643446423] [2019-11-27 22:35:40,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705563318] [2019-11-27 22:35:40,064 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-27 22:35:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:35:40,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:35:40,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:35:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-11-27 22:35:40,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:35:40,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-27 22:35:40,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210785987] [2019-11-27 22:35:40,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:35:40,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:35:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:35:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:35:40,292 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2019-11-27 22:35:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:35:40,463 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2019-11-27 22:35:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:35:40,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-11-27 22:35:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:35:40,464 INFO L225 Difference]: With dead ends: 3784 [2019-11-27 22:35:40,464 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:35:40,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:35:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:35:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:35:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:35:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:35:40,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-11-27 22:35:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:35:40,468 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:35:40,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:35:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:35:40,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:35:40,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:35:40,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:35:41,152 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 96 [2019-11-27 22:35:41,629 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2019-11-27 22:35:41,831 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-11-27 22:35:42,263 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-11-27 22:35:42,603 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-11-27 22:35:42,818 INFO L246 CegarLoopResult]: For program point L168(lines 168 490) no Hoare annotation was computed. [2019-11-27 22:35:42,818 INFO L246 CegarLoopResult]: For program point L135(lines 135 501) no Hoare annotation was computed. [2019-11-27 22:35:42,818 INFO L246 CegarLoopResult]: For program point L102(lines 102 512) no Hoare annotation was computed. [2019-11-27 22:35:42,818 INFO L246 CegarLoopResult]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-27 22:35:42,818 INFO L246 CegarLoopResult]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-27 22:35:42,819 INFO L242 CegarLoopResult]: At program point L136(lines 132 502) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-27 22:35:42,820 INFO L249 CegarLoopResult]: At program point L533(lines 95 534) the Hoare annotation is: true [2019-11-27 22:35:42,820 INFO L246 CegarLoopResult]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-11-27 22:35:42,820 INFO L246 CegarLoopResult]: For program point L236(lines 236 239) no Hoare annotation was computed. [2019-11-27 22:35:42,820 INFO L246 CegarLoopResult]: For program point L269-2(lines 269 273) no Hoare annotation was computed. [2019-11-27 22:35:42,820 INFO L246 CegarLoopResult]: For program point L303(lines 303 306) no Hoare annotation was computed. [2019-11-27 22:35:42,820 INFO L242 CegarLoopResult]: At program point L204(lines 102 512) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0) (and .cse0 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1))) [2019-11-27 22:35:42,820 INFO L246 CegarLoopResult]: For program point L171(lines 171 489) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L138(lines 138 500) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L105(lines 105 511) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L242 CegarLoopResult]: At program point L172(lines 168 490) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L471(lines 471 473) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L438(lines 438 449) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L405(lines 405 419) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L405-1(lines 405 419) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L438-2(lines 438 449) no Hoare annotation was computed. [2019-11-27 22:35:42,821 INFO L246 CegarLoopResult]: For program point L174(lines 174 488) no Hoare annotation was computed. [2019-11-27 22:35:42,822 INFO L246 CegarLoopResult]: For program point L141(lines 141 499) no Hoare annotation was computed. [2019-11-27 22:35:42,823 INFO L246 CegarLoopResult]: For program point L108(lines 108 510) no Hoare annotation was computed. [2019-11-27 22:35:42,823 INFO L246 CegarLoopResult]: For program point L538(lines 538 540) no Hoare annotation was computed. [2019-11-27 22:35:42,823 INFO L246 CegarLoopResult]: For program point L538-2(lines 538 540) no Hoare annotation was computed. [2019-11-27 22:35:42,824 INFO L242 CegarLoopResult]: At program point L142(lines 138 500) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-27 22:35:42,824 INFO L246 CegarLoopResult]: For program point L341(lines 341 343) no Hoare annotation was computed. [2019-11-27 22:35:42,824 INFO L246 CegarLoopResult]: For program point L209(lines 209 211) no Hoare annotation was computed. [2019-11-27 22:35:42,824 INFO L246 CegarLoopResult]: For program point L209-2(lines 209 211) no Hoare annotation was computed. [2019-11-27 22:35:42,824 INFO L246 CegarLoopResult]: For program point L375(lines 375 377) no Hoare annotation was computed. [2019-11-27 22:35:42,824 INFO L246 CegarLoopResult]: For program point L177(lines 177 487) no Hoare annotation was computed. [2019-11-27 22:35:42,824 INFO L246 CegarLoopResult]: For program point L144(lines 144 498) no Hoare annotation was computed. [2019-11-27 22:35:42,824 INFO L246 CegarLoopResult]: For program point L111(lines 111 509) no Hoare annotation was computed. [2019-11-27 22:35:42,825 INFO L246 CegarLoopResult]: For program point L409(lines 409 415) no Hoare annotation was computed. [2019-11-27 22:35:42,825 INFO L242 CegarLoopResult]: At program point L178(lines 174 488) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-27 22:35:42,825 INFO L246 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2019-11-27 22:35:42,825 INFO L246 CegarLoopResult]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-27 22:35:42,825 INFO L246 CegarLoopResult]: For program point L278-1(lines 278 288) no Hoare annotation was computed. [2019-11-27 22:35:42,826 INFO L249 CegarLoopResult]: At program point L543(lines 10 545) the Hoare annotation is: true [2019-11-27 22:35:42,826 INFO L242 CegarLoopResult]: At program point L312(lines 74 544) the Hoare annotation is: false [2019-11-27 22:35:42,826 INFO L246 CegarLoopResult]: For program point L180(lines 180 486) no Hoare annotation was computed. [2019-11-27 22:35:42,827 INFO L246 CegarLoopResult]: For program point L147(lines 147 497) no Hoare annotation was computed. [2019-11-27 22:35:42,828 INFO L246 CegarLoopResult]: For program point L114(lines 114 508) no Hoare annotation was computed. [2019-11-27 22:35:42,828 INFO L246 CegarLoopResult]: For program point L214(lines 214 217) no Hoare annotation was computed. [2019-11-27 22:35:42,828 INFO L242 CegarLoopResult]: At program point L148(lines 144 498) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse3 .cse2))) [2019-11-27 22:35:42,828 INFO L246 CegarLoopResult]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-11-27 22:35:42,828 INFO L242 CegarLoopResult]: At program point L479(lines 96 532) the Hoare annotation is: (let ((.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse4 (= 4528 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse7 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse2 (= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse3 .cse1) (and .cse3 .cse1 (= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse4 .cse3 .cse1) (and .cse5 .cse6 .cse3 .cse7 .cse1 .cse8) (and .cse9 .cse3 .cse8) (and .cse3 (= 4496 ULTIMATE.start_ssl3_connect_~s__state~0) .cse1) (and .cse0 .cse9 .cse8) (and (= 4480 ULTIMATE.start_ssl3_connect_~s__state~0) .cse3 .cse1) (and .cse4 .cse0) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse10 .cse11 .cse3 .cse7 .cse1 .cse8) (and .cse2 .cse0) (and .cse5 .cse6 .cse0) (and .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11))) [2019-11-27 22:35:42,828 INFO L246 CegarLoopResult]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L248(lines 248 250) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L248-2(lines 199 478) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L381(lines 381 385) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L381-2(lines 199 478) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L282-2(lines 280 288) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L183(lines 183 485) no Hoare annotation was computed. [2019-11-27 22:35:42,829 INFO L246 CegarLoopResult]: For program point L150(lines 150 496) no Hoare annotation was computed. [2019-11-27 22:35:42,830 INFO L246 CegarLoopResult]: For program point L117(lines 117 507) no Hoare annotation was computed. [2019-11-27 22:35:42,830 INFO L246 CegarLoopResult]: For program point L514(lines 514 530) no Hoare annotation was computed. [2019-11-27 22:35:42,830 INFO L242 CegarLoopResult]: At program point L184(lines 180 486) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-27 22:35:42,830 INFO L242 CegarLoopResult]: At program point L118(lines 114 508) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-27 22:35:42,830 INFO L246 CegarLoopResult]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-11-27 22:35:42,830 INFO L246 CegarLoopResult]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-11-27 22:35:42,830 INFO L246 CegarLoopResult]: For program point L515(lines 515 529) no Hoare annotation was computed. [2019-11-27 22:35:42,830 INFO L246 CegarLoopResult]: For program point L350(lines 350 352) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L516(lines 516 521) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L516-2(lines 515 529) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L186(lines 186 484) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L153(lines 153 495) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L120(lines 120 506) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L220(lines 220 231) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L220-2(lines 199 478) no Hoare annotation was computed. [2019-11-27 22:35:42,831 INFO L246 CegarLoopResult]: For program point L518(lines 518 520) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L354(lines 354 359) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L354-2(lines 354 359) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L222(lines 222 225) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L189(lines 189 483) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L156(lines 156 494) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L123(lines 123 505) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point L454-1(lines 454 456) no Hoare annotation was computed. [2019-11-27 22:35:42,832 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:35:42,833 INFO L246 CegarLoopResult]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-27 22:35:42,833 INFO L242 CegarLoopResult]: At program point L190(lines 186 484) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse4 .cse3) (and .cse0 .cse1 .cse4) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse3))) [2019-11-27 22:35:42,834 INFO L242 CegarLoopResult]: At program point L124(lines 120 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-27 22:35:42,834 INFO L246 CegarLoopResult]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-11-27 22:35:42,834 INFO L249 CegarLoopResult]: At program point L554(lines 546 556) the Hoare annotation is: true [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L323-2(lines 199 478) no Hoare annotation was computed. [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L390(lines 390 393) no Hoare annotation was computed. [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L192(lines 192 482) no Hoare annotation was computed. [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L159(lines 159 493) no Hoare annotation was computed. [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L126(lines 126 504) no Hoare annotation was computed. [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L523(lines 523 527) no Hoare annotation was computed. [2019-11-27 22:35:42,835 INFO L246 CegarLoopResult]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-11-27 22:35:42,836 INFO L242 CegarLoopResult]: At program point L193(lines 192 482) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 .cse4 .cse1 .cse3) (and .cse0 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1))) [2019-11-27 22:35:42,836 INFO L242 CegarLoopResult]: At program point L160(lines 150 496) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-27 22:35:42,836 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:35:42,836 INFO L246 CegarLoopResult]: For program point L425(lines 425 427) no Hoare annotation was computed. [2019-11-27 22:35:42,836 INFO L246 CegarLoopResult]: For program point L195(lines 195 481) no Hoare annotation was computed. [2019-11-27 22:35:42,836 INFO L246 CegarLoopResult]: For program point L162(lines 162 492) no Hoare annotation was computed. [2019-11-27 22:35:42,836 INFO L246 CegarLoopResult]: For program point L129(lines 129 503) no Hoare annotation was computed. [2019-11-27 22:35:42,837 INFO L246 CegarLoopResult]: For program point L96-1(lines 74 544) no Hoare annotation was computed. [2019-11-27 22:35:42,837 INFO L246 CegarLoopResult]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-27 22:35:42,837 INFO L246 CegarLoopResult]: For program point L460-2(lines 460 462) no Hoare annotation was computed. [2019-11-27 22:35:42,837 INFO L246 CegarLoopResult]: For program point L295(lines 295 297) no Hoare annotation was computed. [2019-11-27 22:35:42,837 INFO L246 CegarLoopResult]: For program point L295-2(lines 199 478) no Hoare annotation was computed. [2019-11-27 22:35:42,839 INFO L249 CegarLoopResult]: At program point L196(lines 195 481) the Hoare annotation is: true [2019-11-27 22:35:42,840 INFO L242 CegarLoopResult]: At program point L130(lines 126 504) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-27 22:35:42,840 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-27 22:35:42,840 INFO L246 CegarLoopResult]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-11-27 22:35:42,840 INFO L246 CegarLoopResult]: For program point L428-2(lines 428 432) no Hoare annotation was computed. [2019-11-27 22:35:42,840 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-27 22:35:42,840 INFO L246 CegarLoopResult]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-27 22:35:42,840 INFO L246 CegarLoopResult]: For program point L329-2(lines 329 333) no Hoare annotation was computed. [2019-11-27 22:35:42,840 INFO L246 CegarLoopResult]: For program point L263-2(lines 199 478) no Hoare annotation was computed. [2019-11-27 22:35:42,841 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-11-27 22:35:42,841 INFO L249 CegarLoopResult]: At program point L198(lines 197 481) the Hoare annotation is: true [2019-11-27 22:35:42,841 INFO L246 CegarLoopResult]: For program point L165(lines 165 491) no Hoare annotation was computed. [2019-11-27 22:35:42,841 INFO L246 CegarLoopResult]: For program point L132(lines 132 502) no Hoare annotation was computed. [2019-11-27 22:35:42,841 INFO L246 CegarLoopResult]: For program point L99(lines 99 513) no Hoare annotation was computed. [2019-11-27 22:35:42,841 INFO L242 CegarLoopResult]: At program point L166(lines 162 492) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-11-27 22:35:42,841 INFO L242 CegarLoopResult]: At program point L100(lines 99 513) the Hoare annotation is: (let ((.cse0 (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-11-27 22:35:42,841 INFO L246 CegarLoopResult]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-27 22:35:42,842 INFO L246 CegarLoopResult]: For program point L365(lines 365 367) no Hoare annotation was computed. [2019-11-27 22:35:42,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:35:42 BoogieIcfgContainer [2019-11-27 22:35:42,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:35:42,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:35:42,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:35:42,892 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:35:42,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:35:28" (3/4) ... [2019-11-27 22:35:42,896 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:35:42,923 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:35:42,924 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:35:43,081 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:35:43,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:35:43,083 INFO L168 Benchmark]: Toolchain (without parser) took 15910.27 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 740.8 MB). Free memory was 963.0 MB in the beginning and 784.3 MB in the end (delta: 178.8 MB). Peak memory consumption was 919.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:43,083 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:35:43,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:43,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.81 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-27 22:35:43,084 INFO L168 Benchmark]: Boogie Preprocessor took 45.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:43,084 INFO L168 Benchmark]: RCFGBuilder took 773.49 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:43,085 INFO L168 Benchmark]: TraceAbstraction took 14357.95 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 615.5 MB). Free memory was 1.1 GB in the beginning and 802.4 MB in the end (delta: 252.6 MB). Peak memory consumption was 868.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:43,085 INFO L168 Benchmark]: Witness Printer took 189.22 ms. Allocated memory is still 1.8 GB. Free memory was 802.4 MB in the beginning and 784.3 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:35:43,087 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.81 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 45.77 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 773.49 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: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14357.95 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 615.5 MB). Free memory was 1.1 GB in the beginning and 802.4 MB in the end (delta: 252.6 MB). Peak memory consumption was 868.1 MB. Max. memory is 11.5 GB. * Witness Printer took 189.22 ms. Allocated memory is still 1.8 GB. Free memory was 802.4 MB in the beginning and 784.3 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: 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: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((4560 <= s__state && blastFlag <= 2) && 0 == s__hit)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((4560 <= s__state && blastFlag <= 4) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((blastFlag <= 2 && 4368 == s__state) || (blastFlag <= 2 && 0 == s__hit)) || ((4512 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 0 == s__hit) && 4464 == s__state)) || ((4528 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && s__s3__tmp__new_cipher__algorithms == 256) && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 4496 == s__state) && 0 == s__hit)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || ((4480 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (4528 == s__state && blastFlag <= 2)) || (blastFlag <= 2 && 4384 == s__state)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (4512 == s__state && blastFlag <= 2)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) || (blastFlag <= 2 && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 12292 == s__state) || (((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 12292 == s__state) && 0 == s__hit) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: SAFE, OverallTime: 12.0s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 4616 SDtfs, 1482 SDslu, 2556 SDs, 0 SdLazy, 2390 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1553 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9585occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 13142 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1989 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 6398 NumberOfCodeBlocks, 6398 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6370 ConstructedInterpolants, 0 QuantifiedInterpolants, 2622380 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 21955/22034 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...