./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.25-f470102 [2019-11-28 15:39:54,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:39:54,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:39:54,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:39:54,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:39:54,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:39:54,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:39:54,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:39:54,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:39:54,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:39:54,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:39:54,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:39:54,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:39:54,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:39:54,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:39:54,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:39:54,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:39:54,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:39:54,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:39:54,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:39:54,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:39:54,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:39:54,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:39:54,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:39:54,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:39:54,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:39:54,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:39:54,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:39:54,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:39:54,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:39:54,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:39:54,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:39:54,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:39:54,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:39:54,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:39:54,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:39:54,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:39:54,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:39:54,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:39:54,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:39:54,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:39:54,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:39:54,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:39:54,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:39:54,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:39:54,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:39:54,997 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:39:54,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:39:54,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:39:54,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:39:54,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:39:54,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:39:54,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:39:54,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:39:54,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:39:55,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:39:55,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:39:55,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:39:55,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:39:55,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:39:55,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:39:55,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:39:55,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:39:55,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:39:55,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:39:55,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:39:55,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:39:55,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:39:55,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:39:55,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:39:55,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:39:55,004 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-28 15:39:55,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:39:55,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:39:55,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:39:55,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:39:55,410 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:39:55,411 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-28 15:39:55,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d007d7f4/14b756f2e18347bcbb8e43f24c3cb2ee/FLAGf4679f622 [2019-11-28 15:39:55,981 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:39:55,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-11-28 15:39:55,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d007d7f4/14b756f2e18347bcbb8e43f24c3cb2ee/FLAGf4679f622 [2019-11-28 15:39:56,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d007d7f4/14b756f2e18347bcbb8e43f24c3cb2ee [2019-11-28 15:39:56,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:39:56,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:39:56,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:56,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:39:56,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:39:56,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56, skipping insertion in model container [2019-11-28 15:39:56,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:39:56,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:39:56,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:56,774 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:39:56,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:56,842 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:39:56,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56 WrapperNode [2019-11-28 15:39:56,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:56,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:56,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:39:56,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:39:56,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:56,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:39:56,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:39:56,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:39:56,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... [2019-11-28 15:39:56,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:39:56,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:39:56,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:39:56,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:39:56,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:39:57,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:39:57,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:39:57,149 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:39:57,743 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 15:39:57,743 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 15:39:57,745 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:39:57,745 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:39:57,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:57 BoogieIcfgContainer [2019-11-28 15:39:57,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:39:57,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:39:57,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:39:57,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:39:57,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:39:56" (1/3) ... [2019-11-28 15:39:57,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b492f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:57, skipping insertion in model container [2019-11-28 15:39:57,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:56" (2/3) ... [2019-11-28 15:39:57,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b492f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:57, skipping insertion in model container [2019-11-28 15:39:57,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:57" (3/3) ... [2019-11-28 15:39:57,756 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-11-28 15:39:57,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:39:57,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:39:57,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:39:57,825 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:39:57,826 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:39:57,827 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:39:57,827 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:39:57,828 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:39:57,828 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:39:57,828 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:39:57,828 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:39:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-28 15:39:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:39:57,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:57,867 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-28 15:39:57,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-11-28 15:39:57,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:57,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262012621] [2019-11-28 15:39:57,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:58,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262012621] [2019-11-28 15:39:58,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:39:58,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382324673] [2019-11-28 15:39:58,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:58,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:58,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,169 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-11-28 15:39:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:58,418 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-11-28 15:39:58,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:58,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:39:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:58,431 INFO L225 Difference]: With dead ends: 249 [2019-11-28 15:39:58,432 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 15:39:58,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 15:39:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 15:39:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 15:39:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-11-28 15:39:58,481 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-11-28 15:39:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:58,482 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-11-28 15:39:58,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-11-28 15:39:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:39:58,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:58,484 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-28 15:39:58,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-11-28 15:39:58,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:58,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980819403] [2019-11-28 15:39:58,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,570 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-28 15:39:58,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980819403] [2019-11-28 15:39:58,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:58,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595244911] [2019-11-28 15:39:58,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:58,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:58,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,577 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-11-28 15:39:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:58,791 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-11-28 15:39:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:58,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 15:39:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:58,796 INFO L225 Difference]: With dead ends: 235 [2019-11-28 15:39:58,796 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 15:39:58,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 15:39:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-11-28 15:39:58,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 15:39:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-11-28 15:39:58,832 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-11-28 15:39:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:58,833 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-11-28 15:39:58,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-11-28 15:39:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 15:39:58,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:58,837 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-28 15:39:58,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-11-28 15:39:58,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:58,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290661893] [2019-11-28 15:39:58,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:58,963 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-28 15:39:58,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290661893] [2019-11-28 15:39:58,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:58,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:58,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529136783] [2019-11-28 15:39:58,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:58,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:58,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:58,969 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-11-28 15:39:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,134 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-11-28 15:39:59,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:59,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 15:39:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,137 INFO L225 Difference]: With dead ends: 268 [2019-11-28 15:39:59,137 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 15:39:59,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 15:39:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-11-28 15:39:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-28 15:39:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-28 15:39:59,150 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-11-28 15:39:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,150 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-28 15:39:59,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-28 15:39:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:39:59,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,153 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-28 15:39:59,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-11-28 15:39:59,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789762226] [2019-11-28 15:39:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:59,281 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-28 15:39:59,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789762226] [2019-11-28 15:39:59,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:59,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:59,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209625711] [2019-11-28 15:39:59,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:59,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,285 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-28 15:39:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,493 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-11-28 15:39:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:59,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:39:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,497 INFO L225 Difference]: With dead ends: 332 [2019-11-28 15:39:59,497 INFO L226 Difference]: Without dead ends: 195 [2019-11-28 15:39:59,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-28 15:39:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-11-28 15:39:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:39:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-11-28 15:39:59,514 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-11-28 15:39:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,515 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-11-28 15:39:59,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-11-28 15:39:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:39:59,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,518 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-28 15:39:59,518 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-11-28 15:39:59,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713384841] [2019-11-28 15:39:59,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:59,582 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-28 15:39:59,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713384841] [2019-11-28 15:39:59,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:59,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:59,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424395495] [2019-11-28 15:39:59,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:59,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,585 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-11-28 15:39:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,721 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-11-28 15:39:59,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:59,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:39:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,724 INFO L225 Difference]: With dead ends: 386 [2019-11-28 15:39:59,724 INFO L226 Difference]: Without dead ends: 209 [2019-11-28 15:39:59,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-28 15:39:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-11-28 15:39:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-28 15:39:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-11-28 15:39:59,737 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-11-28 15:39:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,738 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-11-28 15:39:59,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-11-28 15:39:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:39:59,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,741 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-28 15:39:59,741 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-11-28 15:39:59,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282809759] [2019-11-28 15:39:59,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:59,808 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-28 15:39:59,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282809759] [2019-11-28 15:39:59,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:59,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:59,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574706316] [2019-11-28 15:39:59,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:59,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,811 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-11-28 15:39:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:59,941 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-11-28 15:39:59,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:59,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:39:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:59,944 INFO L225 Difference]: With dead ends: 425 [2019-11-28 15:39:59,944 INFO L226 Difference]: Without dead ends: 229 [2019-11-28 15:39:59,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-28 15:39:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-11-28 15:39:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-28 15:39:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-11-28 15:39:59,954 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-11-28 15:39:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:59,955 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-11-28 15:39:59,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-11-28 15:39:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-28 15:39:59,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:59,958 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-28 15:39:59,958 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-11-28 15:39:59,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:59,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846801904] [2019-11-28 15:39:59,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,040 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-28 15:40:00,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846801904] [2019-11-28 15:40:00,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:00,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349852119] [2019-11-28 15:40:00,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:00,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,052 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-11-28 15:40:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,094 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-11-28 15:40:00,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:00,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-28 15:40:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,100 INFO L225 Difference]: With dead ends: 658 [2019-11-28 15:40:00,100 INFO L226 Difference]: Without dead ends: 441 [2019-11-28 15:40:00,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-28 15:40:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-11-28 15:40:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-28 15:40:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-11-28 15:40:00,117 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-11-28 15:40:00,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:00,117 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-11-28 15:40:00,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-11-28 15:40:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 15:40:00,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,120 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-28 15:40:00,120 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-11-28 15:40:00,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504417894] [2019-11-28 15:40:00,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,204 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-28 15:40:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504417894] [2019-11-28 15:40:00,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:00,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978000724] [2019-11-28 15:40:00,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:00,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:00,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,207 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2019-11-28 15:40:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,250 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2019-11-28 15:40:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:00,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-28 15:40:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,255 INFO L225 Difference]: With dead ends: 658 [2019-11-28 15:40:00,256 INFO L226 Difference]: Without dead ends: 656 [2019-11-28 15:40:00,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-28 15:40:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-28 15:40:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-28 15:40:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-28 15:40:00,274 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2019-11-28 15:40:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:00,274 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-28 15:40:00,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-28 15:40:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-28 15:40:00,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,277 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-28 15:40:00,277 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2019-11-28 15:40:00,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198105828] [2019-11-28 15:40:00,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,334 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-28 15:40:00,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198105828] [2019-11-28 15:40:00,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:00,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722800454] [2019-11-28 15:40:00,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:00,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,343 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-28 15:40:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,479 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2019-11-28 15:40:00,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:00,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-28 15:40:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,484 INFO L225 Difference]: With dead ends: 1383 [2019-11-28 15:40:00,484 INFO L226 Difference]: Without dead ends: 736 [2019-11-28 15:40:00,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-28 15:40:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2019-11-28 15:40:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-11-28 15:40:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2019-11-28 15:40:00,505 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2019-11-28 15:40:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:00,506 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2019-11-28 15:40:00,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2019-11-28 15:40:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-28 15:40:00,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,509 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-28 15:40:00,509 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2019-11-28 15:40:00,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851537852] [2019-11-28 15:40:00,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,567 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-28 15:40:00,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851537852] [2019-11-28 15:40:00,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:00,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884737911] [2019-11-28 15:40:00,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:00,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:00,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,570 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2019-11-28 15:40:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:00,748 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2019-11-28 15:40:00,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:00,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-28 15:40:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:00,753 INFO L225 Difference]: With dead ends: 1594 [2019-11-28 15:40:00,754 INFO L226 Difference]: Without dead ends: 875 [2019-11-28 15:40:00,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-11-28 15:40:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2019-11-28 15:40:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-28 15:40:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2019-11-28 15:40:00,777 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2019-11-28 15:40:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:00,777 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2019-11-28 15:40:00,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2019-11-28 15:40:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-28 15:40:00,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:00,782 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-28 15:40:00,782 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2019-11-28 15:40:00,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:00,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094520331] [2019-11-28 15:40:00,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:00,854 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-28 15:40:00,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094520331] [2019-11-28 15:40:00,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:00,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:00,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016257044] [2019-11-28 15:40:00,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:00,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:00,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:00,857 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2019-11-28 15:40:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:01,005 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2019-11-28 15:40:01,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:01,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-28 15:40:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:01,011 INFO L225 Difference]: With dead ends: 1765 [2019-11-28 15:40:01,011 INFO L226 Difference]: Without dead ends: 932 [2019-11-28 15:40:01,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-11-28 15:40:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2019-11-28 15:40:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-28 15:40:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2019-11-28 15:40:01,035 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2019-11-28 15:40:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:01,036 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2019-11-28 15:40:01,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2019-11-28 15:40:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-28 15:40:01,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,040 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-28 15:40:01,040 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2019-11-28 15:40:01,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324124517] [2019-11-28 15:40:01,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:01,115 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-28 15:40:01,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324124517] [2019-11-28 15:40:01,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:01,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:01,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550169573] [2019-11-28 15:40:01,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:01,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:01,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,118 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2019-11-28 15:40:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:01,279 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2019-11-28 15:40:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:01,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-28 15:40:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:01,286 INFO L225 Difference]: With dead ends: 1945 [2019-11-28 15:40:01,287 INFO L226 Difference]: Without dead ends: 1028 [2019-11-28 15:40:01,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-11-28 15:40:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-11-28 15:40:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-28 15:40:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2019-11-28 15:40:01,321 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2019-11-28 15:40:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:01,321 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2019-11-28 15:40:01,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2019-11-28 15:40:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-28 15:40:01,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,328 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-28 15:40:01,329 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2019-11-28 15:40:01,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755629841] [2019-11-28 15:40:01,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:01,462 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-28 15:40:01,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755629841] [2019-11-28 15:40:01,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:01,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:01,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91378076] [2019-11-28 15:40:01,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:01,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,465 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2019-11-28 15:40:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:01,504 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2019-11-28 15:40:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:01,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-28 15:40:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:01,515 INFO L225 Difference]: With dead ends: 3036 [2019-11-28 15:40:01,516 INFO L226 Difference]: Without dead ends: 2026 [2019-11-28 15:40:01,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-11-28 15:40:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2019-11-28 15:40:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-11-28 15:40:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2019-11-28 15:40:01,567 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2019-11-28 15:40:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:01,567 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2019-11-28 15:40:01,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2019-11-28 15:40:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-28 15:40:01,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,574 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-28 15:40:01,574 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2019-11-28 15:40:01,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031733981] [2019-11-28 15:40:01,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:01,666 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-28 15:40:01,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031733981] [2019-11-28 15:40:01,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:01,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:01,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138962006] [2019-11-28 15:40:01,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:01,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:01,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,668 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2019-11-28 15:40:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:01,852 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2019-11-28 15:40:01,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:01,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-28 15:40:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:01,866 INFO L225 Difference]: With dead ends: 4264 [2019-11-28 15:40:01,866 INFO L226 Difference]: Without dead ends: 2249 [2019-11-28 15:40:01,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-11-28 15:40:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2019-11-28 15:40:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-11-28 15:40:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2019-11-28 15:40:01,922 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2019-11-28 15:40:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:01,922 INFO L462 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2019-11-28 15:40:01,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2019-11-28 15:40:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-28 15:40:01,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:01,930 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-28 15:40:01,930 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2019-11-28 15:40:01,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:01,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373091984] [2019-11-28 15:40:01,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:02,028 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-28 15:40:02,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373091984] [2019-11-28 15:40:02,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:02,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:02,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541420518] [2019-11-28 15:40:02,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:02,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:02,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:02,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,031 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2019-11-28 15:40:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,206 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2019-11-28 15:40:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-28 15:40:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,218 INFO L225 Difference]: With dead ends: 4576 [2019-11-28 15:40:02,218 INFO L226 Difference]: Without dead ends: 2348 [2019-11-28 15:40:02,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-11-28 15:40:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2019-11-28 15:40:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-11-28 15:40:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2019-11-28 15:40:02,281 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2019-11-28 15:40:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,281 INFO L462 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2019-11-28 15:40:02,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2019-11-28 15:40:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-28 15:40:02,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,288 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-28 15:40:02,288 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2019-11-28 15:40:02,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908929786] [2019-11-28 15:40:02,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:02,387 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-28 15:40:02,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908929786] [2019-11-28 15:40:02,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:02,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:02,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819762216] [2019-11-28 15:40:02,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:02,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:02,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:02,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,392 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2019-11-28 15:40:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:02,660 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2019-11-28 15:40:02,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:02,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-11-28 15:40:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:02,680 INFO L225 Difference]: With dead ends: 4963 [2019-11-28 15:40:02,681 INFO L226 Difference]: Without dead ends: 2636 [2019-11-28 15:40:02,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-11-28 15:40:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2019-11-28 15:40:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-11-28 15:40:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2019-11-28 15:40:02,825 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2019-11-28 15:40:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:02,826 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2019-11-28 15:40:02,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2019-11-28 15:40:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-28 15:40:02,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:02,843 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-28 15:40:02,843 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2019-11-28 15:40:02,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:02,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598825856] [2019-11-28 15:40:02,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:03,079 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-28 15:40:03,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598825856] [2019-11-28 15:40:03,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578151472] [2019-11-28 15:40:03,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:03,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:03,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:03,357 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-28 15:40:03,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:03,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:03,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249942606] [2019-11-28 15:40:03,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:03,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:03,360 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2019-11-28 15:40:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:03,873 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2019-11-28 15:40:03,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:03,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-28 15:40:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:03,903 INFO L225 Difference]: With dead ends: 8082 [2019-11-28 15:40:03,903 INFO L226 Difference]: Without dead ends: 5509 [2019-11-28 15:40:03,909 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-28 15:40:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-11-28 15:40:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2019-11-28 15:40:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-11-28 15:40:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2019-11-28 15:40:04,052 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2019-11-28 15:40:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,053 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2019-11-28 15:40:04,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2019-11-28 15:40:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-28 15:40:04,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,065 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-28 15:40:04,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:04,278 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2019-11-28 15:40:04,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938903645] [2019-11-28 15:40:04,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,510 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-28 15:40:04,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938903645] [2019-11-28 15:40:04,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613722909] [2019-11-28 15:40:04,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,519 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2019-11-28 15:40:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:04,682 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2019-11-28 15:40:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:04,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-28 15:40:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:04,717 INFO L225 Difference]: With dead ends: 12402 [2019-11-28 15:40:04,717 INFO L226 Difference]: Without dead ends: 7294 [2019-11-28 15:40:04,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-11-28 15:40:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2019-11-28 15:40:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-11-28 15:40:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2019-11-28 15:40:04,923 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2019-11-28 15:40:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,924 INFO L462 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2019-11-28 15:40:04,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2019-11-28 15:40:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-28 15:40:04,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,939 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-28 15:40:04,939 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2019-11-28 15:40:04,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995332431] [2019-11-28 15:40:04,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,055 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-28 15:40:05,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995332431] [2019-11-28 15:40:05,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760490511] [2019-11-28 15:40:05,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,058 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2019-11-28 15:40:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,270 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2019-11-28 15:40:05,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-11-28 15:40:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,288 INFO L225 Difference]: With dead ends: 14569 [2019-11-28 15:40:05,288 INFO L226 Difference]: Without dead ends: 7286 [2019-11-28 15:40:05,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-11-28 15:40:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2019-11-28 15:40:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2019-11-28 15:40:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2019-11-28 15:40:05,499 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2019-11-28 15:40:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,500 INFO L462 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2019-11-28 15:40:05,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2019-11-28 15:40:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-11-28 15:40:05,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,524 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-28 15:40:05,524 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2019-11-28 15:40:05,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329514998] [2019-11-28 15:40:05,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,703 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-28 15:40:05,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329514998] [2019-11-28 15:40:05,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090439187] [2019-11-28 15:40:05,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,707 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2019-11-28 15:40:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,021 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2019-11-28 15:40:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-11-28 15:40:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,043 INFO L225 Difference]: With dead ends: 13675 [2019-11-28 15:40:06,043 INFO L226 Difference]: Without dead ends: 7415 [2019-11-28 15:40:06,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-11-28 15:40:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2019-11-28 15:40:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2019-11-28 15:40:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2019-11-28 15:40:06,264 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2019-11-28 15:40:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:06,264 INFO L462 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2019-11-28 15:40:06,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2019-11-28 15:40:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-28 15:40:06,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,281 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-28 15:40:06,281 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2019-11-28 15:40:06,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534076359] [2019-11-28 15:40:06,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,487 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-28 15:40:06,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534076359] [2019-11-28 15:40:06,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590238823] [2019-11-28 15:40:06,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:06,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:06,853 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-28 15:40:06,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:06,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:06,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867774567] [2019-11-28 15:40:06,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:06,857 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 3 states. [2019-11-28 15:40:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,970 INFO L93 Difference]: Finished difference Result 15401 states and 19915 transitions. [2019-11-28 15:40:06,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-11-28 15:40:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,988 INFO L225 Difference]: With dead ends: 15401 [2019-11-28 15:40:06,989 INFO L226 Difference]: Without dead ends: 8799 [2019-11-28 15:40:06,999 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-28 15:40:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-11-28 15:40:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 8799. [2019-11-28 15:40:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8799 states. [2019-11-28 15:40:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8799 states to 8799 states and 11356 transitions. [2019-11-28 15:40:07,213 INFO L78 Accepts]: Start accepts. Automaton has 8799 states and 11356 transitions. Word has length 371 [2019-11-28 15:40:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,214 INFO L462 AbstractCegarLoop]: Abstraction has 8799 states and 11356 transitions. [2019-11-28 15:40:07,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8799 states and 11356 transitions. [2019-11-28 15:40:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-28 15:40:07,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,233 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-28 15:40:07,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:07,446 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash -106230564, now seen corresponding path program 1 times [2019-11-28 15:40:07,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201527300] [2019-11-28 15:40:07,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,685 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-28 15:40:07,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201527300] [2019-11-28 15:40:07,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463452176] [2019-11-28 15:40:07,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:07,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:07,920 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-28 15:40:07,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:07,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:07,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091927336] [2019-11-28 15:40:07,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:07,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:07,928 INFO L87 Difference]: Start difference. First operand 8799 states and 11356 transitions. Second operand 4 states. [2019-11-28 15:40:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,317 INFO L93 Difference]: Finished difference Result 19741 states and 25400 transitions. [2019-11-28 15:40:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:40:08,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-28 15:40:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,338 INFO L225 Difference]: With dead ends: 19741 [2019-11-28 15:40:08,339 INFO L226 Difference]: Without dead ends: 10934 [2019-11-28 15:40:08,351 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-28 15:40:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-11-28 15:40:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2019-11-28 15:40:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-11-28 15:40:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2019-11-28 15:40:08,549 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 373 [2019-11-28 15:40:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,550 INFO L462 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2019-11-28 15:40:08,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2019-11-28 15:40:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-28 15:40:08,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,572 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-28 15:40:08,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:08,776 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2019-11-28 15:40:08,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221616836] [2019-11-28 15:40:08,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,985 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-28 15:40:08,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221616836] [2019-11-28 15:40:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:08,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249048266] [2019-11-28 15:40:08,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:08,989 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2019-11-28 15:40:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,233 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2019-11-28 15:40:09,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:09,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-28 15:40:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:09,242 INFO L225 Difference]: With dead ends: 18222 [2019-11-28 15:40:09,242 INFO L226 Difference]: Without dead ends: 3798 [2019-11-28 15:40:09,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-11-28 15:40:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2019-11-28 15:40:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-11-28 15:40:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2019-11-28 15:40:09,415 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2019-11-28 15:40:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:09,416 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2019-11-28 15:40:09,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2019-11-28 15:40:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-28 15:40:09,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:09,428 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-28 15:40:09,429 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2019-11-28 15:40:09,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:09,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771357818] [2019-11-28 15:40:09,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,697 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-28 15:40:09,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771357818] [2019-11-28 15:40:09,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730180881] [2019-11-28 15:40:09,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:09,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:10,100 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-28 15:40:10,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:10,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:10,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460487026] [2019-11-28 15:40:10,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:10,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:10,103 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2019-11-28 15:40:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:10,403 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2019-11-28 15:40:10,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:40:10,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-11-28 15:40:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:10,405 INFO L225 Difference]: With dead ends: 3784 [2019-11-28 15:40:10,405 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:10,409 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-28 15:40:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:10,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-11-28 15:40:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:10,411 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:10,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:10,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:10,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:10,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:11,246 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 96 [2019-11-28 15:40:12,256 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-11-28 15:40:12,673 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-11-28 15:40:12,997 INFO L246 CegarLoopResult]: For program point L168(lines 168 490) no Hoare annotation was computed. [2019-11-28 15:40:12,997 INFO L246 CegarLoopResult]: For program point L135(lines 135 501) no Hoare annotation was computed. [2019-11-28 15:40:12,997 INFO L246 CegarLoopResult]: For program point L102(lines 102 512) no Hoare annotation was computed. [2019-11-28 15:40:12,997 INFO L246 CegarLoopResult]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-28 15:40:12,997 INFO L246 CegarLoopResult]: For program point L466-2(lines 466 468) no Hoare annotation was computed. [2019-11-28 15:40:12,998 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-28 15:40:12,998 INFO L249 CegarLoopResult]: At program point L533(lines 95 534) the Hoare annotation is: true [2019-11-28 15:40:12,998 INFO L246 CegarLoopResult]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-11-28 15:40:12,998 INFO L246 CegarLoopResult]: For program point L236(lines 236 239) no Hoare annotation was computed. [2019-11-28 15:40:12,998 INFO L246 CegarLoopResult]: For program point L269-2(lines 269 273) no Hoare annotation was computed. [2019-11-28 15:40:12,998 INFO L246 CegarLoopResult]: For program point L303(lines 303 306) no Hoare annotation was computed. [2019-11-28 15:40:12,998 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-28 15:40:12,998 INFO L246 CegarLoopResult]: For program point L171(lines 171 489) no Hoare annotation was computed. [2019-11-28 15:40:12,999 INFO L246 CegarLoopResult]: For program point L138(lines 138 500) no Hoare annotation was computed. [2019-11-28 15:40:12,999 INFO L246 CegarLoopResult]: For program point L105(lines 105 511) no Hoare annotation was computed. [2019-11-28 15:40:12,999 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-28 15:40:12,999 INFO L246 CegarLoopResult]: For program point L471(lines 471 473) no Hoare annotation was computed. [2019-11-28 15:40:13,000 INFO L246 CegarLoopResult]: For program point L438(lines 438 449) no Hoare annotation was computed. [2019-11-28 15:40:13,000 INFO L246 CegarLoopResult]: For program point L405(lines 405 419) no Hoare annotation was computed. [2019-11-28 15:40:13,001 INFO L246 CegarLoopResult]: For program point L405-1(lines 405 419) no Hoare annotation was computed. [2019-11-28 15:40:13,001 INFO L246 CegarLoopResult]: For program point L438-2(lines 438 449) no Hoare annotation was computed. [2019-11-28 15:40:13,001 INFO L246 CegarLoopResult]: For program point L174(lines 174 488) no Hoare annotation was computed. [2019-11-28 15:40:13,002 INFO L246 CegarLoopResult]: For program point L141(lines 141 499) no Hoare annotation was computed. [2019-11-28 15:40:13,002 INFO L246 CegarLoopResult]: For program point L108(lines 108 510) no Hoare annotation was computed. [2019-11-28 15:40:13,002 INFO L246 CegarLoopResult]: For program point L538(lines 538 540) no Hoare annotation was computed. [2019-11-28 15:40:13,003 INFO L246 CegarLoopResult]: For program point L538-2(lines 538 540) no Hoare annotation was computed. [2019-11-28 15:40:13,003 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-28 15:40:13,003 INFO L246 CegarLoopResult]: For program point L341(lines 341 343) no Hoare annotation was computed. [2019-11-28 15:40:13,003 INFO L246 CegarLoopResult]: For program point L209(lines 209 211) no Hoare annotation was computed. [2019-11-28 15:40:13,003 INFO L246 CegarLoopResult]: For program point L209-2(lines 209 211) no Hoare annotation was computed. [2019-11-28 15:40:13,003 INFO L246 CegarLoopResult]: For program point L375(lines 375 377) no Hoare annotation was computed. [2019-11-28 15:40:13,003 INFO L246 CegarLoopResult]: For program point L177(lines 177 487) no Hoare annotation was computed. [2019-11-28 15:40:13,004 INFO L246 CegarLoopResult]: For program point L144(lines 144 498) no Hoare annotation was computed. [2019-11-28 15:40:13,004 INFO L246 CegarLoopResult]: For program point L111(lines 111 509) no Hoare annotation was computed. [2019-11-28 15:40:13,004 INFO L246 CegarLoopResult]: For program point L409(lines 409 415) no Hoare annotation was computed. [2019-11-28 15:40:13,004 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-28 15:40:13,004 INFO L246 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2019-11-28 15:40:13,004 INFO L246 CegarLoopResult]: For program point L311(lines 311 313) no Hoare annotation was computed. [2019-11-28 15:40:13,004 INFO L246 CegarLoopResult]: For program point L278-1(lines 278 288) no Hoare annotation was computed. [2019-11-28 15:40:13,005 INFO L249 CegarLoopResult]: At program point L543(lines 10 545) the Hoare annotation is: true [2019-11-28 15:40:13,005 INFO L242 CegarLoopResult]: At program point L312(lines 74 544) the Hoare annotation is: false [2019-11-28 15:40:13,005 INFO L246 CegarLoopResult]: For program point L180(lines 180 486) no Hoare annotation was computed. [2019-11-28 15:40:13,006 INFO L246 CegarLoopResult]: For program point L147(lines 147 497) no Hoare annotation was computed. [2019-11-28 15:40:13,006 INFO L246 CegarLoopResult]: For program point L114(lines 114 508) no Hoare annotation was computed. [2019-11-28 15:40:13,006 INFO L246 CegarLoopResult]: For program point L214(lines 214 217) no Hoare annotation was computed. [2019-11-28 15:40:13,007 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-28 15:40:13,007 INFO L246 CegarLoopResult]: For program point L82(lines 82 88) no Hoare annotation was computed. [2019-11-28 15:40:13,007 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-28 15:40:13,007 INFO L246 CegarLoopResult]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-28 15:40:13,008 INFO L246 CegarLoopResult]: For program point L248(lines 248 250) no Hoare annotation was computed. [2019-11-28 15:40:13,008 INFO L246 CegarLoopResult]: For program point L248-2(lines 199 478) no Hoare annotation was computed. [2019-11-28 15:40:13,008 INFO L246 CegarLoopResult]: For program point L381(lines 381 385) no Hoare annotation was computed. [2019-11-28 15:40:13,008 INFO L246 CegarLoopResult]: For program point L381-2(lines 199 478) no Hoare annotation was computed. [2019-11-28 15:40:13,008 INFO L246 CegarLoopResult]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-28 15:40:13,008 INFO L246 CegarLoopResult]: For program point L282-2(lines 280 288) no Hoare annotation was computed. [2019-11-28 15:40:13,008 INFO L246 CegarLoopResult]: For program point L183(lines 183 485) no Hoare annotation was computed. [2019-11-28 15:40:13,009 INFO L246 CegarLoopResult]: For program point L150(lines 150 496) no Hoare annotation was computed. [2019-11-28 15:40:13,009 INFO L246 CegarLoopResult]: For program point L117(lines 117 507) no Hoare annotation was computed. [2019-11-28 15:40:13,009 INFO L246 CegarLoopResult]: For program point L514(lines 514 530) no Hoare annotation was computed. [2019-11-28 15:40:13,009 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-28 15:40:13,009 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-28 15:40:13,009 INFO L246 CegarLoopResult]: For program point L85(lines 85 87) no Hoare annotation was computed. [2019-11-28 15:40:13,009 INFO L246 CegarLoopResult]: For program point L85-2(lines 82 88) no Hoare annotation was computed. [2019-11-28 15:40:13,009 INFO L246 CegarLoopResult]: For program point L515(lines 515 529) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L350(lines 350 352) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L516(lines 516 521) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L516-2(lines 515 529) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L186(lines 186 484) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L153(lines 153 495) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L120(lines 120 506) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L220(lines 220 231) no Hoare annotation was computed. [2019-11-28 15:40:13,010 INFO L246 CegarLoopResult]: For program point L220-2(lines 199 478) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L518(lines 518 520) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L354(lines 354 359) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L354-2(lines 354 359) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L222(lines 222 225) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L189(lines 189 483) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L156(lines 156 494) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L123(lines 123 505) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L90(lines 90 94) no Hoare annotation was computed. [2019-11-28 15:40:13,011 INFO L246 CegarLoopResult]: For program point L454-1(lines 454 456) no Hoare annotation was computed. [2019-11-28 15:40:13,012 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:13,012 INFO L246 CegarLoopResult]: For program point L256(lines 256 258) no Hoare annotation was computed. [2019-11-28 15:40:13,012 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-28 15:40:13,012 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-28 15:40:13,012 INFO L246 CegarLoopResult]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-11-28 15:40:13,013 INFO L249 CegarLoopResult]: At program point L554(lines 546 556) the Hoare annotation is: true [2019-11-28 15:40:13,013 INFO L246 CegarLoopResult]: For program point L323(lines 323 325) no Hoare annotation was computed. [2019-11-28 15:40:13,013 INFO L246 CegarLoopResult]: For program point L323-2(lines 199 478) no Hoare annotation was computed. [2019-11-28 15:40:13,013 INFO L246 CegarLoopResult]: For program point L390(lines 390 393) no Hoare annotation was computed. [2019-11-28 15:40:13,013 INFO L246 CegarLoopResult]: For program point L192(lines 192 482) no Hoare annotation was computed. [2019-11-28 15:40:13,014 INFO L246 CegarLoopResult]: For program point L159(lines 159 493) no Hoare annotation was computed. [2019-11-28 15:40:13,014 INFO L246 CegarLoopResult]: For program point L126(lines 126 504) no Hoare annotation was computed. [2019-11-28 15:40:13,014 INFO L246 CegarLoopResult]: For program point L523(lines 523 527) no Hoare annotation was computed. [2019-11-28 15:40:13,014 INFO L246 CegarLoopResult]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-11-28 15:40:13,014 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-28 15:40:13,014 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-28 15:40:13,014 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L425(lines 425 427) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L195(lines 195 481) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L162(lines 162 492) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L129(lines 129 503) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L96-1(lines 74 544) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L460(lines 460 462) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L460-2(lines 460 462) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L295(lines 295 297) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L246 CegarLoopResult]: For program point L295-2(lines 199 478) no Hoare annotation was computed. [2019-11-28 15:40:13,015 INFO L249 CegarLoopResult]: At program point L196(lines 195 481) the Hoare annotation is: true [2019-11-28 15:40:13,016 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-28 15:40:13,016 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-28 15:40:13,016 INFO L246 CegarLoopResult]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-11-28 15:40:13,016 INFO L246 CegarLoopResult]: For program point L428-2(lines 428 432) no Hoare annotation was computed. [2019-11-28 15:40:13,016 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-11-28 15:40:13,016 INFO L246 CegarLoopResult]: For program point L263(lines 263 265) no Hoare annotation was computed. [2019-11-28 15:40:13,016 INFO L246 CegarLoopResult]: For program point L329-2(lines 329 333) no Hoare annotation was computed. [2019-11-28 15:40:13,016 INFO L246 CegarLoopResult]: For program point L263-2(lines 199 478) no Hoare annotation was computed. [2019-11-28 15:40:13,017 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2019-11-28 15:40:13,017 INFO L249 CegarLoopResult]: At program point L198(lines 197 481) the Hoare annotation is: true [2019-11-28 15:40:13,017 INFO L246 CegarLoopResult]: For program point L165(lines 165 491) no Hoare annotation was computed. [2019-11-28 15:40:13,017 INFO L246 CegarLoopResult]: For program point L132(lines 132 502) no Hoare annotation was computed. [2019-11-28 15:40:13,017 INFO L246 CegarLoopResult]: For program point L99(lines 99 513) no Hoare annotation was computed. [2019-11-28 15:40:13,017 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-28 15:40:13,017 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-28 15:40:13,017 INFO L246 CegarLoopResult]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-28 15:40:13,018 INFO L246 CegarLoopResult]: For program point L365(lines 365 367) no Hoare annotation was computed. [2019-11-28 15:40:13,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:13 BoogieIcfgContainer [2019-11-28 15:40:13,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:13,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:13,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:13,071 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:13,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:57" (3/4) ... [2019-11-28 15:40:13,081 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:13,112 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:40:13,113 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:13,297 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:13,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:13,299 INFO L168 Benchmark]: Toolchain (without parser) took 16997.25 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 884.5 MB). Free memory was 956.3 MB in the beginning and 1.7 GB in the end (delta: -707.1 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:13,300 INFO L168 Benchmark]: CDTParser took 0.52 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-28 15:40:13,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:13,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:13,301 INFO L168 Benchmark]: Boogie Preprocessor took 46.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:13,302 INFO L168 Benchmark]: RCFGBuilder took 783.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:13,302 INFO L168 Benchmark]: TraceAbstraction took 15322.31 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 785.9 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -655.8 MB). Peak memory consumption was 827.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:13,302 INFO L168 Benchmark]: Witness Printer took 226.60 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:13,304 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.52 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 539.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 783.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15322.31 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 785.9 MB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -655.8 MB). Peak memory consumption was 827.0 MB. Max. memory is 11.5 GB. * Witness Printer took 226.60 ms. Allocated memory is still 1.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 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.7s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, HoareTripleCheckerStatistics: 4616 SDtfs, 1482 SDslu, 2556 SDs, 0 SdLazy, 2390 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1553 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 13142 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1989 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s 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...