./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_clnt_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_clnt_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 b4872de39e95e4bc5ccbeb0f1761dba68e05980d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:12:21,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:12:21,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:12:21,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:12:21,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:12:21,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:12:21,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:12:21,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:12:21,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:12:21,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:12:21,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:12:21,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:12:21,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:12:21,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:12:21,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:12:21,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:12:21,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:12:21,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:12:21,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:12:21,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:12:21,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:12:21,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:12:21,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:12:21,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:12:21,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:12:21,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:12:21,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:12:21,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:12:21,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:12:21,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:12:21,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:12:21,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:12:21,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:12:21,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:12:21,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:12:21,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:12:21,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:12:21,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:12:21,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:12:21,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:12:21,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:12:21,147 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:12:21,166 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:12:21,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:12:21,167 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:12:21,167 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:12:21,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:12:21,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:12:21,169 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:12:21,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:12:21,169 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:12:21,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:12:21,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:12:21,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:12:21,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:12:21,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:12:21,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:12:21,171 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:12:21,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:12:21,171 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:12:21,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:12:21,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:12:21,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:12:21,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:12:21,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:21,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:12:21,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:12:21,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:12:21,173 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:12:21,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:12:21,173 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:12:21,173 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:12:21,173 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 -> b4872de39e95e4bc5ccbeb0f1761dba68e05980d [2021-08-25 20:12:21,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:12:21,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:12:21,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:12:21,521 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:12:21,521 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:12:21,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c [2021-08-25 20:12:21,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a713a25e7/87d2400fb9974a758a244883a04f5489/FLAG995d74987 [2021-08-25 20:12:22,083 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:12:22,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c [2021-08-25 20:12:22,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a713a25e7/87d2400fb9974a758a244883a04f5489/FLAG995d74987 [2021-08-25 20:12:22,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a713a25e7/87d2400fb9974a758a244883a04f5489 [2021-08-25 20:12:22,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:12:22,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:12:22,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:22,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:12:22,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:12:22,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:22,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5921114c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22, skipping insertion in model container [2021-08-25 20:12:22,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:22,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:12:22,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:12:22,803 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_clnt_2.cil-2.c[35349,35362] [2021-08-25 20:12:22,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:22,856 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:12:22,914 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_clnt_2.cil-2.c[35349,35362] [2021-08-25 20:12:22,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:12:22,942 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:12:22,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22 WrapperNode [2021-08-25 20:12:22,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:12:22,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:22,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:12:22,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:12:22,955 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:12:22" (1/1) ... [2021-08-25 20:12:22,963 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:12:22" (1/1) ... [2021-08-25 20:12:23,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:12:23,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:12:23,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:12:23,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:12:23,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:12:23,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:12:23,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:12:23,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:12:23,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (1/1) ... [2021-08-25 20:12:23,064 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:12:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:23,088 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:12:23,090 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:12:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:12:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:12:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:12:23,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:12:23,264 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:12:23,909 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:12:23,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:12:23,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:12:23,921 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:12:23,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:23 BoogieIcfgContainer [2021-08-25 20:12:23,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:12:23,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:12:23,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:12:23,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:12:23,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:12:22" (1/3) ... [2021-08-25 20:12:23,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324049af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:23, skipping insertion in model container [2021-08-25 20:12:23,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:12:22" (2/3) ... [2021-08-25 20:12:23,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324049af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:12:23, skipping insertion in model container [2021-08-25 20:12:23,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:23" (3/3) ... [2021-08-25 20:12:23,932 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2021-08-25 20:12:23,938 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:12:23,938 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:12:23,991 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:12:23,997 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:12:23,997 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:12:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 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:12:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:12:24,018 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:24,018 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] [2021-08-25 20:12:24,019 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:24,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:24,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695038, now seen corresponding path program 1 times [2021-08-25 20:12:24,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:24,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556397178] [2021-08-25 20:12:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:24,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:24,204 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:12:24,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:24,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556397178] [2021-08-25 20:12:24,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556397178] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:24,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:24,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:24,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614383875] [2021-08-25 20:12:24,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:24,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:24,239 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:24,452 INFO L93 Difference]: Finished difference Result 252 states and 427 transitions. [2021-08-25 20:12:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2021-08-25 20:12:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:24,463 INFO L225 Difference]: With dead ends: 252 [2021-08-25 20:12:24,463 INFO L226 Difference]: Without dead ends: 115 [2021-08-25 20:12:24,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-25 20:12:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-08-25 20:12:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 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:12:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2021-08-25 20:12:24,506 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2021-08-25 20:12:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:24,507 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2021-08-25 20:12:24,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:12:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2021-08-25 20:12:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-25 20:12:24,508 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:24,509 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:24,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:12:24,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash 561717339, now seen corresponding path program 1 times [2021-08-25 20:12:24,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:24,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944952528] [2021-08-25 20:12:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:24,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:12:24,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:24,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944952528] [2021-08-25 20:12:24,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944952528] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:24,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:24,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:24,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538266768] [2021-08-25 20:12:24,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:24,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:24,583 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:12:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:24,711 INFO L93 Difference]: Finished difference Result 239 states and 362 transitions. [2021-08-25 20:12:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:24,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2021-08-25 20:12:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:24,717 INFO L225 Difference]: With dead ends: 239 [2021-08-25 20:12:24,717 INFO L226 Difference]: Without dead ends: 134 [2021-08-25 20:12:24,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-25 20:12:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2021-08-25 20:12:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 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:12:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2021-08-25 20:12:24,740 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2021-08-25 20:12:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:24,740 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2021-08-25 20:12:24,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:12:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2021-08-25 20:12:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 20:12:24,744 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:24,745 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:24,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:12:24,746 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash 684962052, now seen corresponding path program 1 times [2021-08-25 20:12:24,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:24,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166186293] [2021-08-25 20:12:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:24,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:12:24,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:24,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166186293] [2021-08-25 20:12:24,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166186293] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:24,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:24,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:24,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350680838] [2021-08-25 20:12:24,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:24,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:24,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:24,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:24,832 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:12:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:24,934 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2021-08-25 20:12:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2021-08-25 20:12:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:24,936 INFO L225 Difference]: With dead ends: 271 [2021-08-25 20:12:24,937 INFO L226 Difference]: Without dead ends: 151 [2021-08-25 20:12:24,937 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:12:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-08-25 20:12:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2021-08-25 20:12:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4657534246575343) internal successors, (214), 146 states have internal predecessors, (214), 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:12:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2021-08-25 20:12:24,945 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 51 [2021-08-25 20:12:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:24,945 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2021-08-25 20:12:24,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:12:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2021-08-25 20:12:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-25 20:12:24,947 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:24,947 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:24,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:12:24,947 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash -184561774, now seen corresponding path program 1 times [2021-08-25 20:12:24,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:24,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579927377] [2021-08-25 20:12:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:24,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:12:25,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579927377] [2021-08-25 20:12:25,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579927377] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592834214] [2021-08-25 20:12:25,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,010 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:12:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,151 INFO L93 Difference]: Finished difference Result 335 states and 503 transitions. [2021-08-25 20:12:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2021-08-25 20:12:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,153 INFO L225 Difference]: With dead ends: 335 [2021-08-25 20:12:25,153 INFO L226 Difference]: Without dead ends: 197 [2021-08-25 20:12:25,154 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:12:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-25 20:12:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2021-08-25 20:12:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.411764705882353) internal successors, (264), 187 states have internal predecessors, (264), 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:12:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2021-08-25 20:12:25,162 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 68 [2021-08-25 20:12:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,162 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2021-08-25 20:12:25,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:12:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2021-08-25 20:12:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-25 20:12:25,164 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,164 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:12:25,164 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1990000108, now seen corresponding path program 1 times [2021-08-25 20:12:25,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50116248] [2021-08-25 20:12:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-25 20:12:25,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50116248] [2021-08-25 20:12:25,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50116248] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901925054] [2021-08-25 20:12:25,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,253 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:12:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,366 INFO L93 Difference]: Finished difference Result 390 states and 555 transitions. [2021-08-25 20:12:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2021-08-25 20:12:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,369 INFO L225 Difference]: With dead ends: 390 [2021-08-25 20:12:25,369 INFO L226 Difference]: Without dead ends: 212 [2021-08-25 20:12:25,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-08-25 20:12:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2021-08-25 20:12:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.3980582524271845) internal successors, (288), 206 states have internal predecessors, (288), 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:12:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2021-08-25 20:12:25,387 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 68 [2021-08-25 20:12:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,389 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2021-08-25 20:12:25,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:12:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2021-08-25 20:12:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:12:25,392 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,393 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:12:25,393 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,394 INFO L82 PathProgramCache]: Analyzing trace with hash -843012112, now seen corresponding path program 1 times [2021-08-25 20:12:25,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585559538] [2021-08-25 20:12:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-08-25 20:12:25,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585559538] [2021-08-25 20:12:25,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585559538] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191691751] [2021-08-25 20:12:25,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,498 INFO L87 Difference]: Start difference. First operand 207 states and 288 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:12:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,635 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2021-08-25 20:12:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,635 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 85 [2021-08-25 20:12:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,637 INFO L225 Difference]: With dead ends: 428 [2021-08-25 20:12:25,637 INFO L226 Difference]: Without dead ends: 231 [2021-08-25 20:12:25,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-08-25 20:12:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2021-08-25 20:12:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.3832599118942732) internal successors, (314), 227 states have internal predecessors, (314), 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:12:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2021-08-25 20:12:25,643 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 85 [2021-08-25 20:12:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,644 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2021-08-25 20:12:25,644 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:12:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2021-08-25 20:12:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:12:25,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,645 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:12:25,646 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1725839848, now seen corresponding path program 1 times [2021-08-25 20:12:25,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283309174] [2021-08-25 20:12:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-25 20:12:25,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283309174] [2021-08-25 20:12:25,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283309174] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169553128] [2021-08-25 20:12:25,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,722 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:12:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,767 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2021-08-25 20:12:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:12:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,769 INFO L225 Difference]: With dead ends: 661 [2021-08-25 20:12:25,770 INFO L226 Difference]: Without dead ends: 443 [2021-08-25 20:12:25,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-08-25 20:12:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2021-08-25 20:12:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3710407239819005) internal successors, (606), 442 states have internal predecessors, (606), 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:12:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2021-08-25 20:12:25,788 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 105 [2021-08-25 20:12:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,789 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2021-08-25 20:12:25,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:12:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2021-08-25 20:12:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:12:25,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,791 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:12:25,792 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1889855194, now seen corresponding path program 1 times [2021-08-25 20:12:25,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601642775] [2021-08-25 20:12:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-25 20:12:25,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601642775] [2021-08-25 20:12:25,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601642775] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875792593] [2021-08-25 20:12:25,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,851 INFO L87 Difference]: Start difference. First operand 443 states and 606 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:12:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,871 INFO L93 Difference]: Finished difference Result 897 states and 1226 transitions. [2021-08-25 20:12:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,872 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 105 [2021-08-25 20:12:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,874 INFO L225 Difference]: With dead ends: 897 [2021-08-25 20:12:25,874 INFO L226 Difference]: Without dead ends: 464 [2021-08-25 20:12:25,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-08-25 20:12:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2021-08-25 20:12:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.367170626349892) internal successors, (633), 463 states have internal predecessors, (633), 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:12:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 633 transitions. [2021-08-25 20:12:25,884 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 633 transitions. Word has length 105 [2021-08-25 20:12:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,885 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 633 transitions. [2021-08-25 20:12:25,885 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:12:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 633 transitions. [2021-08-25 20:12:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:12:25,886 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,886 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:12:25,887 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash -810746188, now seen corresponding path program 1 times [2021-08-25 20:12:25,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610152416] [2021-08-25 20:12:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-08-25 20:12:25,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:25,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610152416] [2021-08-25 20:12:25,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610152416] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:25,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:25,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:25,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165016299] [2021-08-25 20:12:25,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:25,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:25,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:25,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:25,932 INFO L87 Difference]: Start difference. First operand 464 states and 633 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:12:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:25,954 INFO L93 Difference]: Finished difference Result 945 states and 1287 transitions. [2021-08-25 20:12:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:25,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:12:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:25,957 INFO L225 Difference]: With dead ends: 945 [2021-08-25 20:12:25,957 INFO L226 Difference]: Without dead ends: 491 [2021-08-25 20:12:25,958 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:12:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-08-25 20:12:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2021-08-25 20:12:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.3612244897959183) internal successors, (667), 490 states have internal predecessors, (667), 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:12:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 667 transitions. [2021-08-25 20:12:25,969 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 667 transitions. Word has length 106 [2021-08-25 20:12:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:25,969 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 667 transitions. [2021-08-25 20:12:25,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:12:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 667 transitions. [2021-08-25 20:12:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-25 20:12:25,971 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:25,971 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:25,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:12:25,972 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash 625791090, now seen corresponding path program 1 times [2021-08-25 20:12:25,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:25,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106561297] [2021-08-25 20:12:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:25,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-08-25 20:12:26,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106561297] [2021-08-25 20:12:26,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106561297] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841383850] [2021-08-25 20:12:26,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,021 INFO L87 Difference]: Start difference. First operand 491 states and 667 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:12:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,053 INFO L93 Difference]: Finished difference Result 709 states and 967 transitions. [2021-08-25 20:12:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,054 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 107 [2021-08-25 20:12:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,058 INFO L225 Difference]: With dead ends: 709 [2021-08-25 20:12:26,058 INFO L226 Difference]: Without dead ends: 707 [2021-08-25 20:12:26,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2021-08-25 20:12:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2021-08-25 20:12:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.36685552407932) internal successors, (965), 706 states have internal predecessors, (965), 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:12:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 965 transitions. [2021-08-25 20:12:26,076 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 965 transitions. Word has length 107 [2021-08-25 20:12:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,076 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 965 transitions. [2021-08-25 20:12:26,076 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:12:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 965 transitions. [2021-08-25 20:12:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-08-25 20:12:26,079 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,079 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2021-08-25 20:12:26,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:12:26,080 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1290635395, now seen corresponding path program 1 times [2021-08-25 20:12:26,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337489522] [2021-08-25 20:12:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-08-25 20:12:26,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337489522] [2021-08-25 20:12:26,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337489522] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002217316] [2021-08-25 20:12:26,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,144 INFO L87 Difference]: Start difference. First operand 707 states and 965 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:12:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,309 INFO L93 Difference]: Finished difference Result 1530 states and 2149 transitions. [2021-08-25 20:12:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 176 [2021-08-25 20:12:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,313 INFO L225 Difference]: With dead ends: 1530 [2021-08-25 20:12:26,313 INFO L226 Difference]: Without dead ends: 857 [2021-08-25 20:12:26,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2021-08-25 20:12:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 824. [2021-08-25 20:12:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.402187120291616) internal successors, (1154), 823 states have internal predecessors, (1154), 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:12:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1154 transitions. [2021-08-25 20:12:26,336 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1154 transitions. Word has length 176 [2021-08-25 20:12:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,336 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 1154 transitions. [2021-08-25 20:12:26,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:12:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1154 transitions. [2021-08-25 20:12:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-08-25 20:12:26,339 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,339 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-08-25 20:12:26,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:12:26,339 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1154586908, now seen corresponding path program 2 times [2021-08-25 20:12:26,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286368180] [2021-08-25 20:12:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-25 20:12:26,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286368180] [2021-08-25 20:12:26,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286368180] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698707863] [2021-08-25 20:12:26,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,381 INFO L87 Difference]: Start difference. First operand 824 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:12:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,547 INFO L93 Difference]: Finished difference Result 1892 states and 2730 transitions. [2021-08-25 20:12:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 189 [2021-08-25 20:12:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,552 INFO L225 Difference]: With dead ends: 1892 [2021-08-25 20:12:26,552 INFO L226 Difference]: Without dead ends: 1054 [2021-08-25 20:12:26,553 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-08-25 20:12:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1013. [2021-08-25 20:12:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.3893280632411067) internal successors, (1406), 1012 states have internal predecessors, (1406), 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:12:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1406 transitions. [2021-08-25 20:12:26,574 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1406 transitions. Word has length 189 [2021-08-25 20:12:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,574 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1406 transitions. [2021-08-25 20:12:26,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:12:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1406 transitions. [2021-08-25 20:12:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-08-25 20:12:26,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,578 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:12:26,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:12:26,578 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1143144718, now seen corresponding path program 1 times [2021-08-25 20:12:26,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92866155] [2021-08-25 20:12:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-08-25 20:12:26,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92866155] [2021-08-25 20:12:26,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92866155] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40343092] [2021-08-25 20:12:26,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,619 INFO L87 Difference]: Start difference. First operand 1013 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:12:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:26,786 INFO L93 Difference]: Finished difference Result 2148 states and 3007 transitions. [2021-08-25 20:12:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 210 [2021-08-25 20:12:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:26,790 INFO L225 Difference]: With dead ends: 2148 [2021-08-25 20:12:26,790 INFO L226 Difference]: Without dead ends: 1127 [2021-08-25 20:12:26,792 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:12:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-08-25 20:12:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1088. [2021-08-25 20:12:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.3817847286108556) internal successors, (1502), 1087 states have internal predecessors, (1502), 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:12:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1502 transitions. [2021-08-25 20:12:26,813 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1502 transitions. Word has length 210 [2021-08-25 20:12:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:26,813 INFO L470 AbstractCegarLoop]: Abstraction has 1088 states and 1502 transitions. [2021-08-25 20:12:26,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:12:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1502 transitions. [2021-08-25 20:12:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-08-25 20:12:26,816 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:26,816 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:12:26,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:12:26,817 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash 455987487, now seen corresponding path program 1 times [2021-08-25 20:12:26,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:26,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286882472] [2021-08-25 20:12:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:26,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-08-25 20:12:26,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:26,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286882472] [2021-08-25 20:12:26,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286882472] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:26,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:26,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:26,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593109514] [2021-08-25 20:12:26,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:26,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:26,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:26,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:26,868 INFO L87 Difference]: Start difference. First operand 1088 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:12:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,037 INFO L93 Difference]: Finished difference Result 2298 states and 3196 transitions. [2021-08-25 20:12:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 234 [2021-08-25 20:12:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,041 INFO L225 Difference]: With dead ends: 2298 [2021-08-25 20:12:27,042 INFO L226 Difference]: Without dead ends: 1208 [2021-08-25 20:12:27,045 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:12:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-08-25 20:12:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1172. [2021-08-25 20:12:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.3774551665243382) internal successors, (1613), 1171 states have internal predecessors, (1613), 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:12:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1613 transitions. [2021-08-25 20:12:27,068 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1613 transitions. Word has length 234 [2021-08-25 20:12:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,068 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 1613 transitions. [2021-08-25 20:12:27,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:12:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1613 transitions. [2021-08-25 20:12:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-08-25 20:12:27,072 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,072 INFO L512 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:12:27,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:12:27,072 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 574428961, now seen corresponding path program 1 times [2021-08-25 20:12:27,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575468565] [2021-08-25 20:12:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-08-25 20:12:27,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575468565] [2021-08-25 20:12:27,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575468565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910170642] [2021-08-25 20:12:27,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,125 INFO L87 Difference]: Start difference. First operand 1172 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:12:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,292 INFO L93 Difference]: Finished difference Result 2466 states and 3421 transitions. [2021-08-25 20:12:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 234 [2021-08-25 20:12:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,297 INFO L225 Difference]: With dead ends: 2466 [2021-08-25 20:12:27,297 INFO L226 Difference]: Without dead ends: 1304 [2021-08-25 20:12:27,300 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:12:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-08-25 20:12:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1265. [2021-08-25 20:12:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3805379746835442) internal successors, (1745), 1264 states have internal predecessors, (1745), 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:12:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1745 transitions. [2021-08-25 20:12:27,328 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1745 transitions. Word has length 234 [2021-08-25 20:12:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,329 INFO L470 AbstractCegarLoop]: Abstraction has 1265 states and 1745 transitions. [2021-08-25 20:12:27,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:12:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1745 transitions. [2021-08-25 20:12:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-08-25 20:12:27,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,333 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:12:27,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:12:27,333 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash 172133823, now seen corresponding path program 1 times [2021-08-25 20:12:27,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397457174] [2021-08-25 20:12:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2021-08-25 20:12:27,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397457174] [2021-08-25 20:12:27,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397457174] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730387415] [2021-08-25 20:12:27,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,400 INFO L87 Difference]: Start difference. First operand 1265 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:12:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,435 INFO L93 Difference]: Finished difference Result 3718 states and 5136 transitions. [2021-08-25 20:12:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 264 [2021-08-25 20:12:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,445 INFO L225 Difference]: With dead ends: 3718 [2021-08-25 20:12:27,446 INFO L226 Difference]: Without dead ends: 2490 [2021-08-25 20:12:27,448 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:12:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2021-08-25 20:12:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2488. [2021-08-25 20:12:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 1.3811821471652594) internal successors, (3435), 2487 states have internal predecessors, (3435), 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:12:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3435 transitions. [2021-08-25 20:12:27,518 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3435 transitions. Word has length 264 [2021-08-25 20:12:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,518 INFO L470 AbstractCegarLoop]: Abstraction has 2488 states and 3435 transitions. [2021-08-25 20:12:27,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:12:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3435 transitions. [2021-08-25 20:12:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-08-25 20:12:27,525 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,525 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:12:27,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:12:27,525 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash 290575297, now seen corresponding path program 1 times [2021-08-25 20:12:27,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685243426] [2021-08-25 20:12:27,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-08-25 20:12:27,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685243426] [2021-08-25 20:12:27,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685243426] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139914190] [2021-08-25 20:12:27,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,586 INFO L87 Difference]: Start difference. First operand 2488 states and 3435 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:12:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:27,780 INFO L93 Difference]: Finished difference Result 5251 states and 7296 transitions. [2021-08-25 20:12:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 264 [2021-08-25 20:12:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:27,790 INFO L225 Difference]: With dead ends: 5251 [2021-08-25 20:12:27,790 INFO L226 Difference]: Without dead ends: 2770 [2021-08-25 20:12:27,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2021-08-25 20:12:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2698. [2021-08-25 20:12:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2697 states have (on average 1.389321468298109) internal successors, (3747), 2697 states have internal predecessors, (3747), 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:12:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3747 transitions. [2021-08-25 20:12:27,885 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3747 transitions. Word has length 264 [2021-08-25 20:12:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:27,885 INFO L470 AbstractCegarLoop]: Abstraction has 2698 states and 3747 transitions. [2021-08-25 20:12:27,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:12:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3747 transitions. [2021-08-25 20:12:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2021-08-25 20:12:27,892 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:27,892 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:27,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:12:27,892 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1239310138, now seen corresponding path program 1 times [2021-08-25 20:12:27,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:27,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644791973] [2021-08-25 20:12:27,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:27,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-08-25 20:12:27,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:27,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644791973] [2021-08-25 20:12:27,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644791973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:27,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:27,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:27,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921454125] [2021-08-25 20:12:27,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:27,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:27,947 INFO L87 Difference]: Start difference. First operand 2698 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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:12:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:28,124 INFO L93 Difference]: Finished difference Result 5443 states and 7548 transitions. [2021-08-25 20:12:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:28,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 299 [2021-08-25 20:12:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:28,137 INFO L225 Difference]: With dead ends: 5443 [2021-08-25 20:12:28,137 INFO L226 Difference]: Without dead ends: 2764 [2021-08-25 20:12:28,141 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:12:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2021-08-25 20:12:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2692. [2021-08-25 20:12:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.379041248606466) internal successors, (3711), 2691 states have internal predecessors, (3711), 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:12:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3711 transitions. [2021-08-25 20:12:28,241 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3711 transitions. Word has length 299 [2021-08-25 20:12:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:28,241 INFO L470 AbstractCegarLoop]: Abstraction has 2692 states and 3711 transitions. [2021-08-25 20:12:28,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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:12:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3711 transitions. [2021-08-25 20:12:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2021-08-25 20:12:28,250 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:28,250 INFO L512 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:28,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:12:28,251 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:28,251 INFO L82 PathProgramCache]: Analyzing trace with hash 918915254, now seen corresponding path program 1 times [2021-08-25 20:12:28,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:28,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026819621] [2021-08-25 20:12:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:28,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2021-08-25 20:12:28,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:28,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026819621] [2021-08-25 20:12:28,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026819621] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:28,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:28,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:28,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663749246] [2021-08-25 20:12:28,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:28,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:28,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:28,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,328 INFO L87 Difference]: Start difference. First operand 2692 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:12:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:28,487 INFO L93 Difference]: Finished difference Result 5407 states and 7446 transitions. [2021-08-25 20:12:28,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:28,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 322 [2021-08-25 20:12:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:28,497 INFO L225 Difference]: With dead ends: 5407 [2021-08-25 20:12:28,498 INFO L226 Difference]: Without dead ends: 2752 [2021-08-25 20:12:28,501 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:12:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2021-08-25 20:12:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2692. [2021-08-25 20:12:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.358974358974359) internal successors, (3657), 2691 states have internal predecessors, (3657), 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:12:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3657 transitions. [2021-08-25 20:12:28,580 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3657 transitions. Word has length 322 [2021-08-25 20:12:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:28,580 INFO L470 AbstractCegarLoop]: Abstraction has 2692 states and 3657 transitions. [2021-08-25 20:12:28,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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:12:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3657 transitions. [2021-08-25 20:12:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2021-08-25 20:12:28,587 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:28,587 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:28,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:12:28,587 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1665023372, now seen corresponding path program 1 times [2021-08-25 20:12:28,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:28,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819319276] [2021-08-25 20:12:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:28,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 20:12:28,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:28,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819319276] [2021-08-25 20:12:28,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819319276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:28,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:28,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:28,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278799315] [2021-08-25 20:12:28,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:28,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:28,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:28,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:28,647 INFO L87 Difference]: Start difference. First operand 2692 states and 3657 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:12:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:28,815 INFO L93 Difference]: Finished difference Result 5653 states and 7626 transitions. [2021-08-25 20:12:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 336 [2021-08-25 20:12:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:28,825 INFO L225 Difference]: With dead ends: 5653 [2021-08-25 20:12:28,825 INFO L226 Difference]: Without dead ends: 2998 [2021-08-25 20:12:28,828 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:12:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2021-08-25 20:12:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2782. [2021-08-25 20:12:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 1.3581445523193096) internal successors, (3777), 2781 states have internal predecessors, (3777), 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:12:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3777 transitions. [2021-08-25 20:12:28,926 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 3777 transitions. Word has length 336 [2021-08-25 20:12:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:28,927 INFO L470 AbstractCegarLoop]: Abstraction has 2782 states and 3777 transitions. [2021-08-25 20:12:28,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:12:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3777 transitions. [2021-08-25 20:12:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2021-08-25 20:12:28,934 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:28,935 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:28,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:12:28,935 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1597112402, now seen corresponding path program 1 times [2021-08-25 20:12:28,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:28,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17919695] [2021-08-25 20:12:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:28,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2021-08-25 20:12:29,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:29,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17919695] [2021-08-25 20:12:29,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17919695] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:29,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:29,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:29,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422490303] [2021-08-25 20:12:29,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:29,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:29,006 INFO L87 Difference]: Start difference. First operand 2782 states and 3777 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:12:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:29,090 INFO L93 Difference]: Finished difference Result 7882 states and 10755 transitions. [2021-08-25 20:12:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 337 [2021-08-25 20:12:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:29,121 INFO L225 Difference]: With dead ends: 7882 [2021-08-25 20:12:29,121 INFO L226 Difference]: Without dead ends: 5137 [2021-08-25 20:12:29,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2021-08-25 20:12:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5135. [2021-08-25 20:12:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5135 states, 5134 states have (on average 1.36482275029217) internal successors, (7007), 5134 states have internal predecessors, (7007), 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:12:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5135 states to 5135 states and 7007 transitions. [2021-08-25 20:12:29,270 INFO L78 Accepts]: Start accepts. Automaton has 5135 states and 7007 transitions. Word has length 337 [2021-08-25 20:12:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:29,271 INFO L470 AbstractCegarLoop]: Abstraction has 5135 states and 7007 transitions. [2021-08-25 20:12:29,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:12:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5135 states and 7007 transitions. [2021-08-25 20:12:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-08-25 20:12:29,281 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:29,281 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:29,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:12:29,282 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1354743787, now seen corresponding path program 1 times [2021-08-25 20:12:29,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:29,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306984703] [2021-08-25 20:12:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:29,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2021-08-25 20:12:29,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:29,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306984703] [2021-08-25 20:12:29,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306984703] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:29,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68488506] [2021-08-25 20:12:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:29,358 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:29,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:29,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 20:12:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:29,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:29,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2021-08-25 20:12:30,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68488506] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:30,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:30,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:12:30,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891561407] [2021-08-25 20:12:30,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:12:30,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:12:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:12:30,765 INFO L87 Difference]: Start difference. First operand 5135 states and 7007 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:12:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:31,139 INFO L93 Difference]: Finished difference Result 10175 states and 13865 transitions. [2021-08-25 20:12:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:12:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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 361 [2021-08-25 20:12:31,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:31,155 INFO L225 Difference]: With dead ends: 10175 [2021-08-25 20:12:31,155 INFO L226 Difference]: Without dead ends: 7688 [2021-08-25 20:12:31,161 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7688 states. [2021-08-25 20:12:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7688 to 5669. [2021-08-25 20:12:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5669 states, 5668 states have (on average 1.3484474241354976) internal successors, (7643), 5668 states have internal predecessors, (7643), 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:12:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 7643 transitions. [2021-08-25 20:12:31,285 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 7643 transitions. Word has length 361 [2021-08-25 20:12:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:31,286 INFO L470 AbstractCegarLoop]: Abstraction has 5669 states and 7643 transitions. [2021-08-25 20:12:31,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:12:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 7643 transitions. [2021-08-25 20:12:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2021-08-25 20:12:31,296 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:31,296 INFO L512 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:31,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:31,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-25 20:12:31,512 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:31,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:31,512 INFO L82 PathProgramCache]: Analyzing trace with hash 290805068, now seen corresponding path program 2 times [2021-08-25 20:12:31,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:31,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191857621] [2021-08-25 20:12:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:31,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 20:12:31,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:31,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191857621] [2021-08-25 20:12:31,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191857621] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:31,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813821431] [2021-08-25 20:12:31,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:12:31,591 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:31,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:31,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:31,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 20:12:31,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:12:31,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:12:31,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:31,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2021-08-25 20:12:32,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813821431] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:32,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:32,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:12:32,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082170668] [2021-08-25 20:12:32,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:12:32,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:32,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:12:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:12:32,968 INFO L87 Difference]: Start difference. First operand 5669 states and 7643 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:12:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:33,351 INFO L93 Difference]: Finished difference Result 12703 states and 17150 transitions. [2021-08-25 20:12:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:12:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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 374 [2021-08-25 20:12:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:33,367 INFO L225 Difference]: With dead ends: 12703 [2021-08-25 20:12:33,368 INFO L226 Difference]: Without dead ends: 7058 [2021-08-25 20:12:33,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2021-08-25 20:12:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 5789. [2021-08-25 20:12:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 5788 states have (on average 1.3344851416724257) internal successors, (7724), 5788 states have internal predecessors, (7724), 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:12:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7724 transitions. [2021-08-25 20:12:33,504 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7724 transitions. Word has length 374 [2021-08-25 20:12:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:33,505 INFO L470 AbstractCegarLoop]: Abstraction has 5789 states and 7724 transitions. [2021-08-25 20:12:33,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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:12:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7724 transitions. [2021-08-25 20:12:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2021-08-25 20:12:33,516 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:33,517 INFO L512 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:33,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:33,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-25 20:12:33,743 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash -939951161, now seen corresponding path program 1 times [2021-08-25 20:12:33,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:33,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917996356] [2021-08-25 20:12:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:33,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2021-08-25 20:12:33,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:33,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917996356] [2021-08-25 20:12:33,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917996356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:33,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:12:33,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:12:33,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430672564] [2021-08-25 20:12:33,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:33,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:12:33,818 INFO L87 Difference]: Start difference. First operand 5789 states and 7724 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:12:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:34,046 INFO L93 Difference]: Finished difference Result 11133 states and 14642 transitions. [2021-08-25 20:12:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:34,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 413 [2021-08-25 20:12:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:34,053 INFO L225 Difference]: With dead ends: 11133 [2021-08-25 20:12:34,053 INFO L226 Difference]: Without dead ends: 3109 [2021-08-25 20:12:34,060 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:12:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2021-08-25 20:12:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 3043. [2021-08-25 20:12:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3042 states have (on average 1.3356344510190663) internal successors, (4063), 3042 states have internal predecessors, (4063), 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:12:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4063 transitions. [2021-08-25 20:12:34,117 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4063 transitions. Word has length 413 [2021-08-25 20:12:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:34,117 INFO L470 AbstractCegarLoop]: Abstraction has 3043 states and 4063 transitions. [2021-08-25 20:12:34,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:12:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4063 transitions. [2021-08-25 20:12:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2021-08-25 20:12:34,123 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:34,124 INFO L512 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:34,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:12:34,125 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:34,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash -826650578, now seen corresponding path program 1 times [2021-08-25 20:12:34,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:34,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635525599] [2021-08-25 20:12:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:34,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2021-08-25 20:12:34,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:34,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635525599] [2021-08-25 20:12:34,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635525599] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:34,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557278758] [2021-08-25 20:12:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:34,205 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:34,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:34,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:34,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 20:12:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:34,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:34,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2021-08-25 20:12:36,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557278758] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:36,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:12:36,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:12:36,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514469506] [2021-08-25 20:12:36,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:36,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:36,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:36,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:36,124 INFO L87 Difference]: Start difference. First operand 3043 states and 4063 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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:12:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:36,153 INFO L93 Difference]: Finished difference Result 3068 states and 4093 transitions. [2021-08-25 20:12:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 511 [2021-08-25 20:12:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:36,159 INFO L225 Difference]: With dead ends: 3068 [2021-08-25 20:12:36,159 INFO L226 Difference]: Without dead ends: 2571 [2021-08-25 20:12:36,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2021-08-25 20:12:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2548. [2021-08-25 20:12:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2547 states have (on average 1.3345111896348645) internal successors, (3399), 2547 states have internal predecessors, (3399), 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:12:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3399 transitions. [2021-08-25 20:12:36,202 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3399 transitions. Word has length 511 [2021-08-25 20:12:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:36,203 INFO L470 AbstractCegarLoop]: Abstraction has 2548 states and 3399 transitions. [2021-08-25 20:12:36,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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:12:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3399 transitions. [2021-08-25 20:12:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2021-08-25 20:12:36,208 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:36,208 INFO L512 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:36,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:36,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:36,433 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash -301655084, now seen corresponding path program 1 times [2021-08-25 20:12:36,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:36,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755765975] [2021-08-25 20:12:36,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:36,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2021-08-25 20:12:36,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:36,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755765975] [2021-08-25 20:12:36,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755765975] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:36,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070492940] [2021-08-25 20:12:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:36,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:36,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:36,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:36,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 20:12:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:37,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:12:37,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2021-08-25 20:12:38,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070492940] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:12:38,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:12:38,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:12:38,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871690601] [2021-08-25 20:12:38,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:12:38,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:12:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:38,375 INFO L87 Difference]: Start difference. First operand 2548 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:12:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:38,518 INFO L93 Difference]: Finished difference Result 5167 states and 6909 transitions. [2021-08-25 20:12:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:12:38,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 512 [2021-08-25 20:12:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:38,524 INFO L225 Difference]: With dead ends: 5167 [2021-08-25 20:12:38,524 INFO L226 Difference]: Without dead ends: 2656 [2021-08-25 20:12:38,527 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2021-08-25 20:12:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2653. [2021-08-25 20:12:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2652 states have (on average 1.2861990950226245) internal successors, (3411), 2652 states have internal predecessors, (3411), 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:12:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3411 transitions. [2021-08-25 20:12:38,568 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3411 transitions. Word has length 512 [2021-08-25 20:12:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:38,569 INFO L470 AbstractCegarLoop]: Abstraction has 2653 states and 3411 transitions. [2021-08-25 20:12:38,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:12:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3411 transitions. [2021-08-25 20:12:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2021-08-25 20:12:38,576 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:38,576 INFO L512 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:38,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:38,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-25 20:12:38,801 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:38,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:38,801 INFO L82 PathProgramCache]: Analyzing trace with hash 44620561, now seen corresponding path program 2 times [2021-08-25 20:12:38,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:12:38,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850557006] [2021-08-25 20:12:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:12:38,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:12:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2021-08-25 20:12:38,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:12:38,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850557006] [2021-08-25 20:12:38,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850557006] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:38,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203828034] [2021-08-25 20:12:38,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:12:38,892 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:12:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:12:38,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 20:12:38,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 20:12:39,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:12:39,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:12:39,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:12:39,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2021-08-25 20:12:41,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203828034] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:12:41,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:41,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:12:41,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929405821] [2021-08-25 20:12:41,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:12:41,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:12:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:12:41,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:12:41,148 INFO L87 Difference]: Start difference. First operand 2653 states and 3411 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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:12:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:41,321 INFO L93 Difference]: Finished difference Result 2888 states and 3708 transitions. [2021-08-25 20:12:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:12:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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 623 [2021-08-25 20:12:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:41,323 INFO L225 Difference]: With dead ends: 2888 [2021-08-25 20:12:41,323 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:12:41,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:12:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:12:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:12:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:12:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:12:41,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 623 [2021-08-25 20:12:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:41,327 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:12:41,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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:12:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:12:41,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:12:41,330 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:12:41,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:41,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-25 20:12:41,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:12:41,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:41,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:12:42,777 INFO L857 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-08-25 20:12:42,778 INFO L857 garLoopResultBuilder]: For program point L433(lines 433 435) no Hoare annotation was computed. [2021-08-25 20:12:42,778 INFO L857 garLoopResultBuilder]: For program point L334(lines 334 336) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L860 garLoopResultBuilder]: At program point L202(lines 201 489) the Hoare annotation is: true [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L169(lines 169 499) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 510) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 521) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L853 garLoopResultBuilder]: At program point L170(lines 166 500) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) [2021-08-25 20:12:42,779 INFO L853 garLoopResultBuilder]: At program point L104(lines 103 521) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L468-2(lines 468 470) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L436-2(lines 436 440) no Hoare annotation was computed. [2021-08-25 20:12:42,779 INFO L857 garLoopResultBuilder]: For program point L337(lines 337 341) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L271(lines 271 273) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L337-2(lines 337 341) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L271-2(lines 203 486) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 498) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 509) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 520) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L853 garLoopResultBuilder]: At program point L140(lines 136 510) the Hoare annotation is: (and (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L306(lines 306 308) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L240(lines 240 243) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L306-2(lines 203 486) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L406(lines 406 408) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L373(lines 373 375) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L853 garLoopResultBuilder]: At program point L208(lines 106 520) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 497) no Hoare annotation was computed. [2021-08-25 20:12:42,780 INFO L857 garLoopResultBuilder]: For program point L142(lines 142 508) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 519) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L853 garLoopResultBuilder]: At program point L176(lines 172 498) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L474(lines 474 476) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L474-2(lines 474 476) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L860 garLoopResultBuilder]: At program point L541(lines 99 542) the Hoare annotation is: true [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L277-2(lines 277 281) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 496) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L145(lines 145 507) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 518) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L853 garLoopResultBuilder]: At program point L146(lines 142 508) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L213(lines 213 215) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L213-2(lines 213 215) no Hoare annotation was computed. [2021-08-25 20:12:42,781 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 495) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 506) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L115(lines 115 517) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L479(lines 479 481) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L446(lines 446 457) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L413(lines 413 427) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L413-1(lines 413 427) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L446-2(lines 446 457) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L314(lines 314 317) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L853 garLoopResultBuilder]: At program point L182(lines 178 496) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0) (and (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0))) [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L546(lines 546 548) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L546-2(lines 546 548) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 351) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 494) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 505) no Hoare annotation was computed. [2021-08-25 20:12:42,782 INFO L857 garLoopResultBuilder]: For program point L118(lines 118 516) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L383(lines 383 385) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L218(lines 218 221) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L853 garLoopResultBuilder]: At program point L152(lines 148 506) the Hoare annotation is: (and (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 92) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L252(lines 252 258) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L451(lines 451 454) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 493) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 504) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L857 garLoopResultBuilder]: For program point L121(lines 121 515) no Hoare annotation was computed. [2021-08-25 20:12:42,783 INFO L860 garLoopResultBuilder]: At program point L551(lines 12 553) the Hoare annotation is: true [2021-08-25 20:12:42,783 INFO L853 garLoopResultBuilder]: At program point L188(lines 184 494) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)))) [2021-08-25 20:12:42,783 INFO L853 garLoopResultBuilder]: At program point L122(lines 118 516) the Hoare annotation is: (and (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L89(lines 89 91) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L89-2(lines 86 92) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 298) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L255(lines 255 257) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L288-2(lines 288 298) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L255-2(lines 203 486) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L853 garLoopResultBuilder]: At program point L487(lines 100 540) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (let ((.cse0 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse9 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse8 (not .cse2)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse12 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse7 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse5) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1)) (and .cse6 .cse7 .cse4 .cse8) (and (= ULTIMATE.start_ssl3_connect_~blastFlag~0 0) (= ULTIMATE.start_ssl3_connect_~s__state~0 4368)) (and .cse0 .cse4 .cse2) (and .cse9 .cse10 .cse11 .cse1 .cse2) (and (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) .cse2 .cse3 .cse5) (and .cse4 .cse2 .cse12) (and .cse9 .cse10 .cse4 .cse8 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3)) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4416) .cse2 .cse3) (and .cse1 .cse12) (and .cse6 .cse7 .cse11 .cse1 .cse2)))) [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 324) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 492) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L157(lines 157 503) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 514) no Hoare annotation was computed. [2021-08-25 20:12:42,784 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 393) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L853 garLoopResultBuilder]: At program point L323(lines 77 552) the Hoare annotation is: false [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L389-2(lines 203 486) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L224(lines 224 235) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L224-2(lines 203 486) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L522(lines 522 538) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L523(lines 523 537) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L358(lines 358 360) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 327) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L292(lines 292 294) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L226(lines 226 229) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L292-2(lines 290 298) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L193(lines 193 491) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L160(lines 160 502) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L127(lines 127 513) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:12:42,785 INFO L857 garLoopResultBuilder]: For program point L524(lines 524 529) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L524-2(lines 523 537) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L853 garLoopResultBuilder]: At program point L194(lines 190 492) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse2)) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2))) [2021-08-25 20:12:42,786 INFO L853 garLoopResultBuilder]: At program point L128(lines 124 514) the Hoare annotation is: (and (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~blastFlag~0 1) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L95(lines 95 97) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L526(lines 526 528) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 490) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 501) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L130(lines 130 512) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 367) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L362-2(lines 362 367) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L230(lines 230 233) no Hoare annotation was computed. [2021-08-25 20:12:42,786 INFO L853 garLoopResultBuilder]: At program point L197(lines 196 490) the Hoare annotation is: (let ((.cse0 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (not .cse2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3)))) [2021-08-25 20:12:42,786 INFO L853 garLoopResultBuilder]: At program point L164(lines 154 504) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0) (= ULTIMATE.start_ssl3_connect_~s__hit~0 0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) [2021-08-25 20:12:42,786 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L462-1(lines 462 464) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L264(lines 264 266) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L860 garLoopResultBuilder]: At program point L562(lines 554 564) the Hoare annotation is: true [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 489) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L166(lines 166 500) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 511) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L100-1(lines 77 552) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L398(lines 398 401) no Hoare annotation was computed. [2021-08-25 20:12:42,787 INFO L860 garLoopResultBuilder]: At program point L200(lines 199 489) the Hoare annotation is: true [2021-08-25 20:12:42,787 INFO L853 garLoopResultBuilder]: At program point L134(lines 130 512) the Hoare annotation is: (let ((.cse0 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2021-08-25 20:12:42,787 INFO L857 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2021-08-25 20:12:42,791 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:12:42,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:12:42 BoogieIcfgContainer [2021-08-25 20:12:42,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:12:42,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:12:42,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:12:42,809 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:12:42,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:12:23" (3/4) ... [2021-08-25 20:12:42,812 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:12:42,826 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:12:42,827 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:12:42,828 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:12:42,828 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:12:42,896 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:12:42,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:12:42,898 INFO L168 Benchmark]: Toolchain (without parser) took 20301.10 ms. Allocated memory was 65.0 MB in the beginning and 687.9 MB in the end (delta: 622.9 MB). Free memory was 45.1 MB in the beginning and 644.0 MB in the end (delta: -598.8 MB). Peak memory consumption was 425.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:42,898 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 65.0 MB. Free memory is still 47.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:12:42,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.52 ms. Allocated memory is still 65.0 MB. Free memory was 44.9 MB in the beginning and 45.7 MB in the end (delta: -880.3 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:42,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 65.0 MB. Free memory was 45.5 MB in the beginning and 42.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:42,899 INFO L168 Benchmark]: Boogie Preprocessor took 28.96 ms. Allocated memory is still 65.0 MB. Free memory was 42.8 MB in the beginning and 40.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:42,899 INFO L168 Benchmark]: RCFGBuilder took 880.40 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 40.8 MB in the beginning and 46.5 MB in the end (delta: -5.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:42,899 INFO L168 Benchmark]: TraceAbstraction took 18883.48 ms. Allocated memory was 79.7 MB in the beginning and 687.9 MB in the end (delta: 608.2 MB). Free memory was 45.7 MB in the beginning and 248.7 MB in the end (delta: -203.0 MB). Peak memory consumption was 404.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:42,900 INFO L168 Benchmark]: Witness Printer took 88.00 ms. Allocated memory is still 687.9 MB. Free memory was 248.7 MB in the beginning and 644.0 MB in the end (delta: -395.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:12:42,901 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.18 ms. Allocated memory is still 65.0 MB. Free memory is still 47.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 348.52 ms. Allocated memory is still 65.0 MB. Free memory was 44.9 MB in the beginning and 45.7 MB in the end (delta: -880.3 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 65.0 MB. Free memory was 45.5 MB in the beginning and 42.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.96 ms. Allocated memory is still 65.0 MB. Free memory was 42.8 MB in the beginning and 40.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 880.40 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 40.8 MB in the beginning and 46.5 MB in the end (delta: -5.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18883.48 ms. Allocated memory was 79.7 MB in the beginning and 687.9 MB in the end (delta: 608.2 MB). Free memory was 45.7 MB in the beginning and 248.7 MB in the end (delta: -203.0 MB). Peak memory consumption was 404.9 MB. Max. memory is 16.1 GB. * Witness Printer took 88.00 ms. Allocated memory is still 687.9 MB. Free memory was 248.7 MB in the beginning and 644.0 MB in the end (delta: -395.3 MB). Peak memory consumption was 6.3 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 - PositiveResult [Line: 550]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18801.2ms, OverallIterations: 27, TraceHistogramMax: 22, EmptinessCheckTime: 122.5ms, AutomataDifference: 4252.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1231.7ms, InitialAbstractionConstructionTime: 10.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4907 SDtfs, 2135 SDslu, 2647 SDs, 0 SdLazy, 2485 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2194.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2468 GetRequests, 2431 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 114.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5789occurred in iteration=23, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1218.6ms AutomataMinimizationTime, 27 MinimizatonAttempts, 4017 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 9020 FormulaSimplificationTreeSizeReduction, 329.3ms HoareSimplificationTime, 22 FomulaSimplificationsInter, 2033 FormulaSimplificationTreeSizeReductionInter, 888.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 244.3ms SsaConstructionTime, 920.7ms SatisfiabilityAnalysisTime, 7505.9ms InterpolantComputationTime, 8796 NumberOfCodeBlocks, 8796 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 8764 ConstructedInterpolants, 0 QuantifiedInterpolants, 11786 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4093 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 39205/39291 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: blastFlag == 0 && 12292 == s__state - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && s__state <= 4432) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && blastFlag <= 4) || (((4352 <= s__state && blastFlag == 2) && s__state <= 4432) && s__hit == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((s__state <= 4448 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (4352 <= s__state && blastFlag == 1) && s__state <= 4432 - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: blastFlag == 0 && s__state <= 4352 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((4352 <= s__state && s__state <= 4432) && s__hit == 0) && blastFlag <= 4 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && s__state <= 4352) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) || ((((4352 <= s__state && s__state <= 4352) && blastFlag == 2) && !(s__hit == 0)) && s__s3__tmp__next_state___0 <= 3) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && 4560 <= s__state) && blastFlag == 2) && !(s__hit == 0)) || ((((s__state <= 4560 && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__state <= 4464) && s__hit == 0) && blastFlag <= 4 - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((((4400 == s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && blastFlag <= 4) || ((blastFlag == 2 && 4512 <= s__state) && s__state <= 4528)) || (s__state == 4384 && blastFlag == 1)) || (((s__state <= 4560 && 4560 <= s__state) && blastFlag == 2) && !(s__hit == 0))) || (blastFlag == 0 && s__state == 4368)) || ((4400 == s__state && blastFlag == 2) && s__hit == 0)) || ((((4352 <= s__state && s__state <= 4352) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4528)) || ((blastFlag == 2 && s__hit == 0) && s__state <= 3)) || ((((4352 <= s__state && s__state <= 4352) && blastFlag == 2) && !(s__hit == 0)) && s__s3__tmp__next_state___0 <= 3)) || ((s__state == 4416 && s__hit == 0) && blastFlag <= 4)) || (s__s3__tmp__next_state___0 <= 4560 && s__state <= 3)) || ((((s__state <= 4560 && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (4352 <= s__state && blastFlag == 0) && s__state <= 4432 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag == 2) && 4512 <= s__state) || (((s__state <= 4560 && 4432 <= s__state) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (((s__state <= 4560 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && 4432 <= s__state) && s__hit == 0) && blastFlag <= 4 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((blastFlag == 2 && 4512 <= s__state) && s__state <= 4528) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4528) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:12:42,943 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...