./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/openssl-simplified/s3_srvr_2.cil-2.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7047f55ac2887c2060382be67f6b237af9da492 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:13:13,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:13:13,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:13:13,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:13:13,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:13:13,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:13:13,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:13:13,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:13:13,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:13:13,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:13:13,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:13:13,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:13:13,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:13:13,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:13:13,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:13:13,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:13:13,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:13:13,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:13:13,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:13:13,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:13:13,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:13:13,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:13:13,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:13:13,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:13:13,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:13:13,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:13:13,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:13:13,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:13:13,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:13:13,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:13:13,970 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:13:13,971 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:13:13,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:13:13,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:13:13,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:13:13,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:13:13,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:13:13,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:13:13,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:13:13,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:13:13,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:13:13,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:13:13,999 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:13:13,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:13:13,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:13:13,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:13:14,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:13:14,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:13:14,001 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:13:14,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:13:14,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:13:14,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:13:14,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:13:14,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:13:14,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:13:14,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:13:14,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:13:14,002 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:13:14,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:13:14,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:13:14,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:13:14,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:13:14,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:13:14,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:13:14,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:14,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:13:14,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:13:14,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:13:14,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:13:14,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:13:14,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:13:14,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:13:14,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> f7047f55ac2887c2060382be67f6b237af9da492 [2021-08-25 20:13:14,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:13:14,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:13:14,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:13:14,272 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:13:14,272 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:13:14,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-2.c [2021-08-25 20:13:14,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d51221d99/f8178d4f63244f51a225d95915c9b04c/FLAG8c08bc9a9 [2021-08-25 20:13:14,696 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:13:14,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-2.c [2021-08-25 20:13:14,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d51221d99/f8178d4f63244f51a225d95915c9b04c/FLAG8c08bc9a9 [2021-08-25 20:13:14,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d51221d99/f8178d4f63244f51a225d95915c9b04c [2021-08-25 20:13:14,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:13:14,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:13:14,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:14,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:13:14,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:13:14,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:14" (1/1) ... [2021-08-25 20:13:14,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134ac1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:14, skipping insertion in model container [2021-08-25 20:13:14,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:14" (1/1) ... [2021-08-25 20:13:14,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:13:14,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:13:14,931 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-2.c[42399,42412] [2021-08-25 20:13:14,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:14,952 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:13:15,026 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_2.cil-2.c[42399,42412] [2021-08-25 20:13:15,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:15,037 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:13:15,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15 WrapperNode [2021-08-25 20:13:15,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:15,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:15,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:13:15,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:13:15,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:15,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:13:15,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:13:15,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:13:15,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:13:15,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:13:15,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:13:15,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:13:15,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,156 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:15,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:13:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:13:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:13:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:13:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:13:15,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:13:15,338 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:13:15,735 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:13:15,736 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:13:15,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:13:15,741 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:13:15,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:15 BoogieIcfgContainer [2021-08-25 20:13:15,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:13:15,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:13:15,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:13:15,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:13:15,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:13:14" (1/3) ... [2021-08-25 20:13:15,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdcb67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:15, skipping insertion in model container [2021-08-25 20:13:15,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (2/3) ... [2021-08-25 20:13:15,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdcb67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:15, skipping insertion in model container [2021-08-25 20:13:15,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:15" (3/3) ... [2021-08-25 20:13:15,748 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-2.c [2021-08-25 20:13:15,751 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:13:15,751 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:13:15,779 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:13:15,783 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:13:15,783 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:13:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:13:15,799 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:15,800 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:15,800 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-08-25 20:13:15,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:15,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722396002] [2021-08-25 20:13:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:15,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:15,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:15,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722396002] [2021-08-25 20:13:15,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722396002] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:15,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:15,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:15,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066792343] [2021-08-25 20:13:15,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:15,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:15,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:15,967 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:16,174 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-08-25 20:13:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:16,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-25 20:13:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:16,186 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:13:16,186 INFO L226 Difference]: Without dead ends: 175 [2021-08-25 20:13:16,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-25 20:13:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-08-25 20:13:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-08-25 20:13:16,218 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-08-25 20:13:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:16,219 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-08-25 20:13:16,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-08-25 20:13:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:13:16,220 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:16,222 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:16,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:13:16,223 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-08-25 20:13:16,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:16,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970153750] [2021-08-25 20:13:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:16,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:16,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:16,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970153750] [2021-08-25 20:13:16,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970153750] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:16,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:16,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:16,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664730859] [2021-08-25 20:13:16,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:16,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:16,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,310 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:16,473 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-08-25 20:13:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-25 20:13:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:16,475 INFO L225 Difference]: With dead ends: 380 [2021-08-25 20:13:16,475 INFO L226 Difference]: Without dead ends: 216 [2021-08-25 20:13:16,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-25 20:13:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-08-25 20:13:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-08-25 20:13:16,506 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-08-25 20:13:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:16,506 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-08-25 20:13:16,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-08-25 20:13:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:13:16,508 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:16,508 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:16,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:13:16,508 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2071968837, now seen corresponding path program 1 times [2021-08-25 20:13:16,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:16,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178704559] [2021-08-25 20:13:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:16,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:16,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:16,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178704559] [2021-08-25 20:13:16,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178704559] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:16,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:16,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:16,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305170450] [2021-08-25 20:13:16,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:16,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:16,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:16,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,549 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:16,684 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-08-25 20:13:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-25 20:13:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:16,687 INFO L225 Difference]: With dead ends: 445 [2021-08-25 20:13:16,687 INFO L226 Difference]: Without dead ends: 242 [2021-08-25 20:13:16,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-25 20:13:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-25 20:13:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-08-25 20:13:16,698 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-08-25 20:13:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:16,699 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-08-25 20:13:16,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-08-25 20:13:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:16,701 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:16,702 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:16,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:13:16,702 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:16,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash -947039589, now seen corresponding path program 1 times [2021-08-25 20:13:16,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:16,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621145665] [2021-08-25 20:13:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:16,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:16,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:16,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621145665] [2021-08-25 20:13:16,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621145665] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:16,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:16,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:16,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117075561] [2021-08-25 20:13:16,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:16,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:16,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,752 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:16,881 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-08-25 20:13:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:16,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:13:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:16,886 INFO L225 Difference]: With dead ends: 493 [2021-08-25 20:13:16,886 INFO L226 Difference]: Without dead ends: 259 [2021-08-25 20:13:16,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-25 20:13:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-08-25 20:13:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-08-25 20:13:16,903 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-08-25 20:13:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:16,904 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-08-25 20:13:16,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-08-25 20:13:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:16,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:16,908 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:16,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:13:16,908 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1168944985, now seen corresponding path program 1 times [2021-08-25 20:13:16,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:16,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099773967] [2021-08-25 20:13:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:16,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:16,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:16,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099773967] [2021-08-25 20:13:16,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099773967] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:16,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:16,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:16,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828271973] [2021-08-25 20:13:16,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:16,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:16,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,973 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,102 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2021-08-25 20:13:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-08-25 20:13:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,106 INFO L225 Difference]: With dead ends: 552 [2021-08-25 20:13:17,106 INFO L226 Difference]: Without dead ends: 303 [2021-08-25 20:13:17,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-25 20:13:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-08-25 20:13:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-08-25 20:13:17,114 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-08-25 20:13:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,114 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-08-25 20:13:17,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-08-25 20:13:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:17,116 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,116 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:17,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:13:17,116 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2129818626, now seen corresponding path program 1 times [2021-08-25 20:13:17,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548606435] [2021-08-25 20:13:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:17,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548606435] [2021-08-25 20:13:17,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548606435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34762088] [2021-08-25 20:13:17,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,158 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,250 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-08-25 20:13:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-25 20:13:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,254 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:13:17,255 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:13:17,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:13:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-08-25 20:13:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-08-25 20:13:17,261 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-08-25 20:13:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,261 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-08-25 20:13:17,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-08-25 20:13:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:17,262 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,262 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:17,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:13:17,262 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash -122958423, now seen corresponding path program 1 times [2021-08-25 20:13:17,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102834254] [2021-08-25 20:13:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:17,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102834254] [2021-08-25 20:13:17,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102834254] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717104572] [2021-08-25 20:13:17,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,297 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,430 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2021-08-25 20:13:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-25 20:13:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,432 INFO L225 Difference]: With dead ends: 594 [2021-08-25 20:13:17,433 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:13:17,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:13:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-08-25 20:13:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-08-25 20:13:17,441 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-08-25 20:13:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,441 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-08-25 20:13:17,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-08-25 20:13:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:13:17,443 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,443 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:17,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:13:17,443 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1553184093, now seen corresponding path program 1 times [2021-08-25 20:13:17,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118759964] [2021-08-25 20:13:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:13:17,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118759964] [2021-08-25 20:13:17,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118759964] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716921063] [2021-08-25 20:13:17,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,498 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,572 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-08-25 20:13:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-08-25 20:13:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,573 INFO L225 Difference]: With dead ends: 595 [2021-08-25 20:13:17,573 INFO L226 Difference]: Without dead ends: 306 [2021-08-25 20:13:17,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-25 20:13:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-08-25 20:13:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-08-25 20:13:17,581 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-08-25 20:13:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,581 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-08-25 20:13:17,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-08-25 20:13:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:13:17,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,582 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:17,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:13:17,582 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2083521026, now seen corresponding path program 1 times [2021-08-25 20:13:17,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968556193] [2021-08-25 20:13:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:17,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968556193] [2021-08-25 20:13:17,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968556193] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999469079] [2021-08-25 20:13:17,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,647 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,779 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-08-25 20:13:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-25 20:13:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,781 INFO L225 Difference]: With dead ends: 635 [2021-08-25 20:13:17,781 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:17,781 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-08-25 20:13:17,788 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-08-25 20:13:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,789 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-08-25 20:13:17,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-08-25 20:13:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:13:17,790 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,790 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:17,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:13:17,790 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash -102460539, now seen corresponding path program 1 times [2021-08-25 20:13:17,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165146545] [2021-08-25 20:13:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:17,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165146545] [2021-08-25 20:13:17,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165146545] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736433585] [2021-08-25 20:13:17,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,816 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,926 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-08-25 20:13:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-08-25 20:13:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,928 INFO L225 Difference]: With dead ends: 664 [2021-08-25 20:13:17,928 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:17,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-08-25 20:13:17,936 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-08-25 20:13:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,937 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-08-25 20:13:17,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-08-25 20:13:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:13:17,938 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,938 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:17,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:13:17,938 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash -651386898, now seen corresponding path program 1 times [2021-08-25 20:13:17,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182772290] [2021-08-25 20:13:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:17,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182772290] [2021-08-25 20:13:17,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182772290] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165973520] [2021-08-25 20:13:17,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,966 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,069 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-08-25 20:13:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:13:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,071 INFO L225 Difference]: With dead ends: 697 [2021-08-25 20:13:18,071 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:18,072 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-08-25 20:13:18,080 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-08-25 20:13:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,080 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-08-25 20:13:18,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-08-25 20:13:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:13:18,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,082 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:13:18,082 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1258189035, now seen corresponding path program 1 times [2021-08-25 20:13:18,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967249402] [2021-08-25 20:13:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:18,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967249402] [2021-08-25 20:13:18,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967249402] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512344297] [2021-08-25 20:13:18,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,110 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,220 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-08-25 20:13:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-08-25 20:13:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,223 INFO L225 Difference]: With dead ends: 724 [2021-08-25 20:13:18,223 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:18,224 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-08-25 20:13:18,232 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-08-25 20:13:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,233 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-08-25 20:13:18,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-08-25 20:13:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:13:18,234 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,235 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:13:18,235 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1027805126, now seen corresponding path program 1 times [2021-08-25 20:13:18,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786861755] [2021-08-25 20:13:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:18,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786861755] [2021-08-25 20:13:18,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786861755] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752617037] [2021-08-25 20:13:18,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,262 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,353 INFO L93 Difference]: Finished difference Result 742 states and 1195 transitions. [2021-08-25 20:13:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-08-25 20:13:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,355 INFO L225 Difference]: With dead ends: 742 [2021-08-25 20:13:18,355 INFO L226 Difference]: Without dead ends: 388 [2021-08-25 20:13:18,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-25 20:13:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-08-25 20:13:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-08-25 20:13:18,376 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-08-25 20:13:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,376 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-08-25 20:13:18,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-08-25 20:13:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:13:18,377 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,377 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:13:18,378 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1570072403, now seen corresponding path program 1 times [2021-08-25 20:13:18,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107940615] [2021-08-25 20:13:18,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:18,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107940615] [2021-08-25 20:13:18,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107940615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930194250] [2021-08-25 20:13:18,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,407 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,503 INFO L93 Difference]: Finished difference Result 763 states and 1218 transitions. [2021-08-25 20:13:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-25 20:13:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,506 INFO L225 Difference]: With dead ends: 763 [2021-08-25 20:13:18,506 INFO L226 Difference]: Without dead ends: 388 [2021-08-25 20:13:18,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-25 20:13:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2021-08-25 20:13:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-08-25 20:13:18,515 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-08-25 20:13:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,515 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-08-25 20:13:18,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-08-25 20:13:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:13:18,517 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,517 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:18,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:13:18,517 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1383340250, now seen corresponding path program 1 times [2021-08-25 20:13:18,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124718785] [2021-08-25 20:13:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:13:18,542 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:13:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:13:18,598 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:13:18,598 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:13:18,599 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:13:18,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:13:18,603 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:13:18,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:13:18 BoogieIcfgContainer [2021-08-25 20:13:18,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:13:18,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:13:18,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:13:18,682 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:13:18,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:15" (3/4) ... [2021-08-25 20:13:18,684 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:13:18,768 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:13:18,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:13:18,770 INFO L168 Benchmark]: Toolchain (without parser) took 4052.16 ms. Allocated memory was 54.5 MB in the beginning and 144.7 MB in the end (delta: 90.2 MB). Free memory was 31.4 MB in the beginning and 114.6 MB in the end (delta: -83.2 MB). Peak memory consumption was 80.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:18,770 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:13:18,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.20 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.2 MB in the beginning and 48.1 MB in the end (delta: -16.9 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:18,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 67.1 MB. Free memory was 47.9 MB in the beginning and 45.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:18,771 INFO L168 Benchmark]: Boogie Preprocessor took 37.67 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 42.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:18,772 INFO L168 Benchmark]: RCFGBuilder took 596.38 ms. Allocated memory is still 67.1 MB. Free memory was 42.9 MB in the beginning and 37.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:18,773 INFO L168 Benchmark]: TraceAbstraction took 2938.15 ms. Allocated memory was 67.1 MB in the beginning and 144.7 MB in the end (delta: 77.6 MB). Free memory was 37.3 MB in the beginning and 50.3 MB in the end (delta: -13.0 MB). Peak memory consumption was 65.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:18,773 INFO L168 Benchmark]: Witness Printer took 86.34 ms. Allocated memory is still 144.7 MB. Free memory was 50.3 MB in the beginning and 114.6 MB in the end (delta: -64.3 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:18,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 319.20 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.2 MB in the beginning and 48.1 MB in the end (delta: -16.9 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 67.1 MB. Free memory was 47.9 MB in the beginning and 45.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.67 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 42.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 596.38 ms. Allocated memory is still 67.1 MB. Free memory was 42.9 MB in the beginning and 37.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2938.15 ms. Allocated memory was 67.1 MB in the beginning and 144.7 MB in the end (delta: 77.6 MB). Free memory was 37.3 MB in the beginning and 50.3 MB in the end (delta: -13.0 MB). Peak memory consumption was 65.6 MB. Max. memory is 16.1 GB. * Witness Printer took 86.34 ms. Allocated memory is still 144.7 MB. Free memory was 50.3 MB in the beginning and 114.6 MB in the end (delta: -64.3 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L614] int s ; [L615] int tmp ; [L619] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L75] s__state = initial_state [L76] blastFlag = 0 [L77] tmp = __VERIFIER_nondet_int() [L78] Time = tmp [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] got_new_session = 0 [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback [L90] s__in_handshake ++ [L91] COND FALSE !(tmp___1 + 12288) [L96] COND FALSE !(s__cert == 0) [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND TRUE s__state == 8464 [L273] s__shutdown = 0 [L274] ret = __VERIFIER_nondet_int() [L275] COND TRUE blastFlag == 0 [L276] blastFlag = 1 [L278] COND FALSE !(ret <= 0) [L281] got_new_session = 1 [L282] s__state = 8496 [L283] s__init_num = 0 [L581] COND FALSE !(! s__s3__tmp__reuse_message) [L598] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND TRUE s__state == 8496 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L295] COND FALSE !(ret <= 0) [L298] COND TRUE \read(s__hit) [L299] s__state = 8656 [L303] s__init_num = 0 [L581] COND FALSE !(! s__s3__tmp__reuse_message) [L598] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND FALSE !(s__state == 8560) [L163] COND FALSE !(s__state == 8561) [L166] COND FALSE !(s__state == 8448) [L169] COND FALSE !(s__state == 8576) [L172] COND FALSE !(s__state == 8577) [L175] COND FALSE !(s__state == 8592) [L178] COND FALSE !(s__state == 8593) [L181] COND FALSE !(s__state == 8608) [L184] COND FALSE !(s__state == 8609) [L187] COND FALSE !(s__state == 8640) [L190] COND FALSE !(s__state == 8641) [L193] COND TRUE s__state == 8656 [L492] s__session__cipher = s__s3__tmp__new_cipher [L493] COND FALSE !(! tmp___9) [L497] ret = __VERIFIER_nondet_int() [L498] COND TRUE blastFlag == 2 [L499] blastFlag = 3 [L501] COND FALSE !(ret <= 0) [L504] s__state = 8672 [L505] s__init_num = 0 [L506] COND FALSE !(! tmp___10) [L581] COND FALSE !(! s__s3__tmp__reuse_message) [L598] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 8192) [L112] COND FALSE !(s__state == 24576) [L115] COND FALSE !(s__state == 8195) [L118] COND FALSE !(s__state == 8480) [L121] COND FALSE !(s__state == 8481) [L124] COND FALSE !(s__state == 8482) [L127] COND FALSE !(s__state == 8464) [L130] COND FALSE !(s__state == 8465) [L133] COND FALSE !(s__state == 8466) [L136] COND FALSE !(s__state == 8496) [L139] COND FALSE !(s__state == 8497) [L142] COND FALSE !(s__state == 8512) [L145] COND FALSE !(s__state == 8513) [L148] COND FALSE !(s__state == 8528) [L151] COND FALSE !(s__state == 8529) [L154] COND FALSE !(s__state == 8544) [L157] COND FALSE !(s__state == 8545) [L160] COND FALSE !(s__state == 8560) [L163] COND FALSE !(s__state == 8561) [L166] COND FALSE !(s__state == 8448) [L169] COND FALSE !(s__state == 8576) [L172] COND FALSE !(s__state == 8577) [L175] COND FALSE !(s__state == 8592) [L178] COND FALSE !(s__state == 8593) [L181] COND FALSE !(s__state == 8608) [L184] COND FALSE !(s__state == 8609) [L187] COND FALSE !(s__state == 8640) [L190] COND FALSE !(s__state == 8641) [L193] COND FALSE !(s__state == 8656) [L196] COND FALSE !(s__state == 8657) [L199] COND TRUE s__state == 8672 [L513] ret = __VERIFIER_nondet_int() [L514] COND TRUE blastFlag == 3 [L609] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2824.5ms, OverallIterations: 15, TraceHistogramMax: 4, EmptinessCheckTime: 24.8ms, AutomataDifference: 1784.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1835 SDtfs, 2038 SDslu, 248 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1059.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=13, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 160.2ms AutomataMinimizationTime, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.9ms SsaConstructionTime, 158.6ms SatisfiabilityAnalysisTime, 411.6ms InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 2250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 636/636 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-25 20:13:18,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...